Base | Representation |
---|---|
bin | 1001001101001000110101… |
… | …0001110011001110111011 |
3 | 1022211120212201102111100211 |
4 | 2103102031101303032323 |
5 | 2311311422140000011 |
6 | 33305400032011551 |
7 | 2063145401510254 |
oct | 223221521631673 |
9 | 38746781374324 |
10 | 10121313203131 |
11 | 3252474494089 |
12 | 11756b3390bb7 |
13 | 585588421360 |
14 | 26dc34a31b2b |
15 | 12842a345b21 |
hex | 9348d4733bb |
10121313203131 has 32 divisors (see below), whose sum is σ = 11425197611520. Its totient is φ = 8905323942144.
The previous prime is 10121313203063. The next prime is 10121313203143. The reversal of 10121313203131 is 13130231312101.
It is a cyclic number.
It is not a de Polignac number, because 10121313203131 - 27 = 10121313203003 is a prime.
It is a super-2 number, since 2×101213132031312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10121313203731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3398386 + ... + 5638408.
It is an arithmetic number, because the mean of its divisors is an integer number (357037425360).
Almost surely, 210121313203131 is an apocalyptic number.
10121313203131 is a deficient number, since it is larger than the sum of its proper divisors (1303884408389).
10121313203131 is a wasteful number, since it uses less digits than its factorization.
10121313203131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2240275.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10121313203131 its reverse (13130231312101), we get a palindrome (23251544515232).
The spelling of 10121313203131 in words is "ten trillion, one hundred twenty-one billion, three hundred thirteen million, two hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.242 sec. • engine limits •