Base | Representation |
---|---|
bin | 111010010001011011001… |
… | …111100011100100101101 |
3 | 112011211011022221112220022 |
4 | 322101123033203210231 |
5 | 1011102043210340042 |
6 | 12303340421331525 |
7 | 562211523100232 |
oct | 72213317434455 |
9 | 15154138845808 |
10 | 4004440324397 |
11 | 1304301193057 |
12 | 548106b66ba5 |
13 | 230803a09b16 |
14 | dbb5cd53789 |
15 | 6e270c0bcd2 |
hex | 3a45b3e392d |
4004440324397 has 4 divisors (see below), whose sum is σ = 4030959796896. Its totient is φ = 3977920851900.
The previous prime is 4004440324361. The next prime is 4004440324421. The reversal of 4004440324397 is 7934230444004.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4004440324397 - 236 = 3935720847661 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4004440324327) 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 in 3 ways as a sum of consecutive naturals, for example, 13259736023 + ... + 13259736324.
It is an arithmetic number, because the mean of its divisors is an integer number (1007739949224).
Almost surely, 24004440324397 is an apocalyptic number.
It is an amenable number.
4004440324397 is a deficient number, since it is larger than the sum of its proper divisors (26519472499).
4004440324397 is a wasteful number, since it uses less digits than its factorization.
4004440324397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26519472498.
The product of its (nonzero) digits is 1161216, while the sum is 44.
The spelling of 4004440324397 in words is "four trillion, four billion, four hundred forty million, three hundred twenty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •