Base | Representation |
---|---|
bin | 10110100100111100… |
… | …11000010110011101 |
3 | 1011021202000101112122 |
4 | 23102132120112131 |
5 | 144311001122023 |
6 | 5322433312325 |
7 | 606241524551 |
oct | 132236302635 |
9 | 34252011478 |
10 | 12121114013 |
11 | 51600643a8 |
12 | 24234056a5 |
13 | 11b228b818 |
14 | 82db47861 |
15 | 4ae1e62c8 |
hex | 2d279859d |
12121114013 has 2 divisors, whose sum is σ = 12121114014. Its totient is φ = 12121114012.
The previous prime is 12121114003. The next prime is 12121114037. The reversal of 12121114013 is 31041112121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11995068484 + 126045529 = 109522^2 + 11227^2 .
It is an emirp because it is prime and its reverse (31041112121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12121114013 - 216 = 12121048477 is a prime.
It is a super-2 number, since 2×121211140132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12121113982 and 12121114000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12121114003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6060557006 + 6060557007.
It is an arithmetic number, because the mean of its divisors is an integer number (6060557007).
Almost surely, 212121114013 is an apocalyptic number.
It is an amenable number.
12121114013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12121114013 is an equidigital number, since it uses as much as digits as its factorization.
12121114013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12121114013 its reverse (31041112121), we get a palindrome (43162226134).
The spelling of 12121114013 in words is "twelve billion, one hundred twenty-one million, one hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •