Base | Representation |
---|---|
bin | 1001011101011011100000… |
… | …0101110000100110011011 |
3 | 1100211100022210222111021212 |
4 | 2113112320011300212123 |
5 | 2330403131302404042 |
6 | 34042125230253335 |
7 | 2122314353104064 |
oct | 227267005604633 |
9 | 40740283874255 |
10 | 10401204341147 |
11 | 3350142767784 |
12 | 11bb9a635724b |
13 | 5a5aa214ac59 |
14 | 27d5c723156b |
15 | 13085c433482 |
hex | 975b817099b |
10401204341147 has 2 divisors, whose sum is σ = 10401204341148. Its totient is φ = 10401204341146.
The previous prime is 10401204341089. The next prime is 10401204341153. The reversal of 10401204341147 is 74114340210401.
It is a happy number.
10401204341147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (74114340210401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10401204341147 - 236 = 10332484864411 is a prime.
It is not a weakly prime, because it can be changed into another prime (10401204341947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5200602170573 + 5200602170574.
It is an arithmetic number, because the mean of its divisors is an integer number (5200602170574).
Almost surely, 210401204341147 is an apocalyptic number.
10401204341147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10401204341147 is an equidigital number, since it uses as much as digits as its factorization.
10401204341147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10752, while the sum is 32.
Adding to 10401204341147 its reverse (74114340210401), we get a palindrome (84515544551548).
The spelling of 10401204341147 in words is "ten trillion, four hundred one billion, two hundred four million, three hundred forty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •