Base | Representation |
---|---|
bin | 1001000110110010011001… |
… | …0110100000011010101011 |
3 | 1022110011021021122100101222 |
4 | 2101230212112200122223 |
5 | 2303020002310414011 |
6 | 33143314034532255 |
7 | 2052233644343240 |
oct | 221544626403253 |
9 | 38404237570358 |
10 | 10012212201131 |
11 | 3210178851528 |
12 | 115852573708b |
13 | 5781bc259a3a |
14 | 268844dc75c7 |
15 | 12569212cddb |
hex | 91b265a06ab |
10012212201131 has 8 divisors (see below), whose sum is σ = 11465008643040. Its totient is φ = 8565035862528.
The previous prime is 10012212201107. The next prime is 10012212201137. The reversal of 10012212201131 is 13110221221001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10012212201131 is a prime.
It is a super-2 number, since 2×100122122011312 (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 (10012212201137) 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, 1405022006 + ... + 1405029131.
It is an arithmetic number, because the mean of its divisors is an integer number (1433126080380).
Almost surely, 210012212201131 is an apocalyptic number.
10012212201131 is a deficient number, since it is larger than the sum of its proper divisors (1452796441909).
10012212201131 is an equidigital number, since it uses as much as digits as its factorization.
10012212201131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2810051653.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10012212201131 its reverse (13110221221001), we get a palindrome (23122433422132).
The spelling of 10012212201131 in words is "ten trillion, twelve billion, two hundred twelve million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •