Base | Representation |
---|---|
bin | 1011001100100110000011… |
… | …0101111001011110011001 |
3 | 1121120220211211100110010221 |
4 | 2303021200311321132121 |
5 | 3103200412224341441 |
6 | 42103332405040041 |
7 | 2410304040004450 |
oct | 263114065713631 |
9 | 47526754313127 |
10 | 12311001012121 |
11 | 3a17080140359 |
12 | 1469b553b6021 |
13 | 6b3bcb70b706 |
14 | 307bd9bb5b97 |
15 | 1653862bd8d1 |
hex | b3260d79799 |
12311001012121 has 16 divisors (see below), whose sum is σ = 14285417595904. Its totient is φ = 10390635843984.
The previous prime is 12311001012067. The next prime is 12311001012139. The reversal of 12311001012121 is 12121010011321.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 12311001012121 - 231 = 12308853528473 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12311001012095 and 12311001012104.
It is not an unprimeable number, because it can be changed into a prime (12311001012181) 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 15 ways as a sum of consecutive naturals, for example, 4069695 + ... + 6417508.
It is an arithmetic number, because the mean of its divisors is an integer number (892838599744).
Almost surely, 212311001012121 is an apocalyptic number.
It is an amenable number.
12311001012121 is a deficient number, since it is larger than the sum of its proper divisors (1974416583783).
12311001012121 is a wasteful number, since it uses less digits than its factorization.
12311001012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10489780.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 12311001012121 its reverse (12121010011321), we get a palindrome (24432011023442).
The spelling of 12311001012121 in words is "twelve trillion, three hundred eleven billion, one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •