Base | Representation |
---|---|
bin | 1001011101011110011110… |
… | …1000100110110011101111 |
3 | 1100211102101101221000201002 |
4 | 2113113213220212303233 |
5 | 2330411300003131411 |
6 | 34042340323110515 |
7 | 2122343210121254 |
oct | 227274750466357 |
9 | 40742341830632 |
10 | 10402002005231 |
11 | 3350511a525a1 |
12 | 11bbb8951243b |
13 | 5a5b9b493835 |
14 | 27d66114d42b |
15 | 1308a749833b |
hex | 975e7a26cef |
10402002005231 has 4 divisors (see below), whose sum is σ = 10949475795000. Its totient is φ = 9854528215464.
The previous prime is 10402002005203. The next prime is 10402002005243. The reversal of 10402002005231 is 13250020020401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10402002005231 is a prime.
It is a super-2 number, since 2×104020020052312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10402002007231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 273736894856 + ... + 273736894893.
It is an arithmetic number, because the mean of its divisors is an integer number (2737368948750).
Almost surely, 210402002005231 is an apocalyptic number.
10402002005231 is a deficient number, since it is larger than the sum of its proper divisors (547473789769).
10402002005231 is an equidigital number, since it uses as much as digits as its factorization.
10402002005231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547473789768.
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 10402002005231 its reverse (13250020020401), we get a palindrome (23652022025632).
The spelling of 10402002005231 in words is "ten trillion, four hundred two billion, two million, five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •