Base | Representation |
---|---|
bin | 1001001101001011011001… |
… | …0001111111111101101011 |
3 | 1022211122122122212100110021 |
4 | 2103102312101333331223 |
5 | 2311314324241334011 |
6 | 33305552204301311 |
7 | 2063201423641144 |
oct | 223226621777553 |
9 | 38748578770407 |
10 | 10122001121131 |
11 | 3252797831059 |
12 | 1175865841837 |
13 | 585667ac0323 |
14 | 26dc9c142acb |
15 | 12846a92d471 |
hex | 934b647ff6b |
10122001121131 has 4 divisors (see below), whose sum is σ = 10122474199552. Its totient is φ = 10121528042712.
The previous prime is 10122001121123. The next prime is 10122001121159. The reversal of 10122001121131 is 13112110022101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10122001121131 - 23 = 10122001121123 is a prime.
It is a super-2 number, since 2×101220011211312 (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 (10122008121131) 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, 236507115 + ... + 236549908.
It is an arithmetic number, because the mean of its divisors is an integer number (2530618549888).
Almost surely, 210122001121131 is an apocalyptic number.
10122001121131 is a deficient number, since it is larger than the sum of its proper divisors (473078421).
10122001121131 is an equidigital number, since it uses as much as digits as its factorization.
10122001121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473078420.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 10122001121131 its reverse (13112110022101), we get a palindrome (23234111143232).
The spelling of 10122001121131 in words is "ten trillion, one hundred twenty-two billion, one million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •