Base | Representation |
---|---|
bin | 1001011000010000000001… |
… | …0001101101011001111001 |
3 | 1100111211122102100111201001 |
4 | 2112010000101231121321 |
5 | 2322423412101320441 |
6 | 33533211411125001 |
7 | 2113014311153524 |
oct | 226040021553171 |
9 | 40454572314631 |
10 | 10312221120121 |
11 | 331642aa8a798 |
12 | 11a66b1ba3761 |
13 | 59a590b8c14b |
14 | 2791853abbbb |
15 | 12d3a049e731 |
hex | 9610046d679 |
10312221120121 has 8 divisors (see below), whose sum is σ = 10333718169984. Its totient is φ = 10290746454240.
The previous prime is 10312221120059. The next prime is 10312221120143. The reversal of 10312221120121 is 12102112221301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10312221120121 - 227 = 10312086902393 is a prime.
It is a super-2 number, since 2×103122211201212 (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 (10312221120181) 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, 4673485 + ... + 6516586.
It is an arithmetic number, because the mean of its divisors is an integer number (1291714771248).
Almost surely, 210312221120121 is an apocalyptic number.
It is an amenable number.
10312221120121 is a deficient number, since it is larger than the sum of its proper divisors (21497049863).
10312221120121 is an equidigital number, since it uses as much as digits as its factorization.
10312221120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11191991.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10312221120121 its reverse (12102112221301), we get a palindrome (22414333341422).
The spelling of 10312221120121 in words is "ten trillion, three hundred twelve billion, two hundred twenty-one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •