Base | Representation |
---|---|
bin | 111010010001011011001… |
… | …111100011100101100101 |
3 | 112011211011022221112222101 |
4 | 322101123033203211211 |
5 | 1011102043210340303 |
6 | 12303340421332101 |
7 | 562211523100342 |
oct | 72213317434545 |
9 | 15154138845871 |
10 | 4004440324453 |
11 | 13043011930a8 |
12 | 548106b67031 |
13 | 230803a09b5a |
14 | dbb5cd537c9 |
15 | 6e270c0bd1d |
hex | 3a45b3e3965 |
4004440324453 has 2 divisors, whose sum is σ = 4004440324454. Its totient is φ = 4004440324452.
The previous prime is 4004440324441. The next prime is 4004440324531. The reversal of 4004440324453 is 3544230444004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2041703769924 + 1962736554529 = 1428882^2 + 1400977^2 .
It is a cyclic number.
It is not a de Polignac number, because 4004440324453 - 25 = 4004440324421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4004440324253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2002220162226 + 2002220162227.
It is an arithmetic number, because the mean of its divisors is an integer number (2002220162227).
Almost surely, 24004440324453 is an apocalyptic number.
It is an amenable number.
4004440324453 is a deficient number, since it is larger than the sum of its proper divisors (1).
4004440324453 is an equidigital number, since it uses as much as digits as its factorization.
4004440324453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 368640, while the sum is 37.
Adding to 4004440324453 its reverse (3544230444004), we get a palindrome (7548670768457).
The spelling of 4004440324453 in words is "four trillion, four billion, four hundred forty million, three hundred twenty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •