Base | Representation |
---|---|
bin | 10001011110110011110… |
… | …010000110010001001001 |
3 | 11020211210111201020010100 |
4 | 101132303302012101021 |
5 | 124140241401130441 |
6 | 2315513012040013 |
7 | 152535430424205 |
oct | 21366362062111 |
9 | 4224714636110 |
10 | 1201312130121 |
11 | 423523419954 |
12 | 1749a5003009 |
13 | 8938b3abc6c |
14 | 422028c5b05 |
15 | 213aeec4cb6 |
hex | 117b3c86449 |
1201312130121 has 12 divisors (see below), whose sum is σ = 1746720214720. Its totient is φ = 795570946200.
The previous prime is 1201312130111. The next prime is 1201312130129. The reversal of 1201312130121 is 1210312131021.
1201312130121 is a `hidden beast` number, since 1 + 201 + 312 + 1 + 30 + 121 = 666.
It is not a de Polignac number, because 1201312130121 - 227 = 1201177912393 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201312130094 and 1201312130103.
It is not an unprimeable number, because it can be changed into a prime (1201312130129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 441982501 + ... + 441985218.
Almost surely, 21201312130121 is an apocalyptic number.
It is an amenable number.
1201312130121 is a deficient number, since it is larger than the sum of its proper divisors (545408084599).
1201312130121 is a wasteful number, since it uses less digits than its factorization.
1201312130121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 883967876 (or 883967873 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1201312130121 its reverse (1210312131021), we get a palindrome (2411624261142).
The spelling of 1201312130121 in words is "one trillion, two hundred one billion, three hundred twelve million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •