Base | Representation |
---|---|
bin | 1001001101000111101011… |
… | …0110101010111011010011 |
3 | 1022211120002011210111102000 |
4 | 2103101322312222323103 |
5 | 2311310304022220311 |
6 | 33305305230525043 |
7 | 2063134626261654 |
oct | 223217266527323 |
9 | 38746064714360 |
10 | 10121004101331 |
11 | 3252325a63352 |
12 | 1175627966783 |
13 | 585539387796 |
14 | 26dc0596d52b |
15 | 12840d13a056 |
hex | 9347adaaed3 |
10121004101331 has 8 divisors (see below), whose sum is σ = 14994080150160. Its totient is φ = 6747336067536.
The previous prime is 10121004101297. The next prime is 10121004101357. The reversal of 10121004101331 is 13310140012101.
It is a happy number.
10121004101331 is a `hidden beast` number, since 1 + 0 + 1 + 210 + 0 + 410 + 13 + 31 = 666.
It is not a de Polignac number, because 10121004101331 - 27 = 10121004101203 is a prime.
It is a super-2 number, since 2×101210041013312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10121004101381) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187426001850 + ... + 187426001903.
It is an arithmetic number, because the mean of its divisors is an integer number (1874260018770).
Almost surely, 210121004101331 is an apocalyptic number.
10121004101331 is a deficient number, since it is larger than the sum of its proper divisors (4873076048829).
10121004101331 is an equidigital number, since it uses as much as digits as its factorization.
10121004101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374852003762 (or 374852003756 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10121004101331 its reverse (13310140012101), we get a palindrome (23431144113432).
The spelling of 10121004101331 in words is "ten trillion, one hundred twenty-one billion, four million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •