Base | Representation |
---|---|
bin | 111101000000001000… |
… | …1001100111110011001 |
3 | 110112010200111221002211 |
4 | 1322000101030332121 |
5 | 4121242224341441 |
6 | 140103034155121 |
7 | 12315220142020 |
oct | 1720021147631 |
9 | 415120457084 |
10 | 131001012121 |
11 | 50614724381 |
12 | 2147bb82aa1 |
13 | c4793a75b5 |
14 | 64aa3db8b7 |
15 | 361ab94a81 |
hex | 1e8044cf99 |
131001012121 has 8 divisors (see below), whose sum is σ = 149719384640. Its totient is φ = 112283625168.
The previous prime is 131001012089. The next prime is 131001012127. The reversal of 131001012121 is 121210100131.
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 not a de Polignac number, because 131001012121 - 25 = 131001012089 is a prime.
It is a super-2 number, since 2×1310010121212 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131001012127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64615 + ... + 515923.
It is an arithmetic number, because the mean of its divisors is an integer number (18714923080).
Almost surely, 2131001012121 is an apocalyptic number.
It is an amenable number.
131001012121 is a deficient number, since it is larger than the sum of its proper divisors (18718372519).
131001012121 is an equidigital number, since it uses as much as digits as its factorization.
131001012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492783.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 131001012121 its reverse (121210100131), we get a palindrome (252211112252).
The spelling of 131001012121 in words is "one hundred thirty-one billion, one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •