Base | Representation |
---|---|
bin | 100011100011010000100… |
… | …011001010101110000111 |
3 | 22122112220200100012111111 |
4 | 203203100203022232013 |
5 | 310011321304212012 |
6 | 5110152304145451 |
7 | 341334546644662 |
oct | 43432043125607 |
9 | 8575820305444 |
10 | 2443040304007 |
11 | 8620a661a666 |
12 | 335589308287 |
13 | 1494baaab504 |
14 | 8635ad186d9 |
15 | 43838263ba7 |
hex | 238d08cab87 |
2443040304007 has 2 divisors, whose sum is σ = 2443040304008. Its totient is φ = 2443040304006.
The previous prime is 2443040303969. The next prime is 2443040304017. The reversal of 2443040304007 is 7004030403442.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2443040304007 - 223 = 2443031915399 is a prime.
It is a super-2 number, since 2×24430403040072 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2443040304007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2443040304017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1221520152003 + 1221520152004.
It is an arithmetic number, because the mean of its divisors is an integer number (1221520152004).
Almost surely, 22443040304007 is an apocalyptic number.
2443040304007 is a deficient number, since it is larger than the sum of its proper divisors (1).
2443040304007 is an equidigital number, since it uses as much as digits as its factorization.
2443040304007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 31.
Adding to 2443040304007 its reverse (7004030403442), we get a palindrome (9447070707449).
The spelling of 2443040304007 in words is "two trillion, four hundred forty-three billion, forty million, three hundred four thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •