Base | Representation |
---|---|
bin | 1001000110010101011101… |
… | …0001100000111000111001 |
3 | 1022102102012211121010201221 |
4 | 2101211113101200320321 |
5 | 2302403044404310322 |
6 | 33135551102512041 |
7 | 2051540265515503 |
oct | 221452721407071 |
9 | 38372184533657 |
10 | 10004443041337 |
11 | 3207951310808 |
12 | 1156b17895621 |
13 | 5775517ab474 |
14 | 26830924cd73 |
15 | 12538a02e9c7 |
hex | 91957460e39 |
10004443041337 has 2 divisors, whose sum is σ = 10004443041338. Its totient is φ = 10004443041336.
The previous prime is 10004443041293. The next prime is 10004443041371. The reversal of 10004443041337 is 73314034440001.
It is an a-pointer prime, because the next prime (10004443041371) can be obtained adding 10004443041337 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7969266894121 + 2035176147216 = 2822989^2 + 1426596^2 .
It is a cyclic number.
It is not a de Polignac number, because 10004443041337 - 219 = 10004442517049 is a prime.
It is not a weakly prime, because it can be changed into another prime (10004443041737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002221520668 + 5002221520669.
It is an arithmetic number, because the mean of its divisors is an integer number (5002221520669).
Almost surely, 210004443041337 is an apocalyptic number.
It is an amenable number.
10004443041337 is a deficient number, since it is larger than the sum of its proper divisors (1).
10004443041337 is an equidigital number, since it uses as much as digits as its factorization.
10004443041337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48384, while the sum is 34.
Adding to 10004443041337 its reverse (73314034440001), we get a palindrome (83318477481338).
The spelling of 10004443041337 in words is "ten trillion, four billion, four hundred forty-three million, forty-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •