Base | Representation |
---|---|
bin | 1001011101011011100000… |
… | …0101110000011011111101 |
3 | 1100211100022210222110101001 |
4 | 2113112320011300123331 |
5 | 2330403131302343402 |
6 | 34042125230250301 |
7 | 2122314353102116 |
oct | 227267005603375 |
9 | 40740283873331 |
10 | 10401204340477 |
11 | 3350142767225 |
12 | 11bb9a6356991 |
13 | 5a5aa214a862 |
14 | 27d5c723120d |
15 | 13085c433187 |
hex | 975b81706fd |
10401204340477 has 2 divisors, whose sum is σ = 10401204340478. Its totient is φ = 10401204340476.
The previous prime is 10401204340453. The next prime is 10401204340489. The reversal of 10401204340477 is 77404340210401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5526585055161 + 4874619285316 = 2350869^2 + 2207854^2 .
It is a cyclic number.
It is not a de Polignac number, because 10401204340477 - 27 = 10401204340349 is a prime.
It is a super-3 number, since 3×104012043404773 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10401204340777) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5200602170238 + 5200602170239.
It is an arithmetic number, because the mean of its divisors is an integer number (5200602170239).
Almost surely, 210401204340477 is an apocalyptic number.
It is an amenable number.
10401204340477 is a deficient number, since it is larger than the sum of its proper divisors (1).
10401204340477 is an equidigital number, since it uses as much as digits as its factorization.
10401204340477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 75264, while the sum is 37.
Adding to 10401204340477 its reverse (77404340210401), we get a palindrome (87805544550878).
The spelling of 10401204340477 in words is "ten trillion, four hundred one billion, two hundred four million, three hundred forty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •