Base | Representation |
---|---|
bin | 10000010100000001100… |
… | …101100110111001100011 |
3 | 10222011112022220212002120 |
4 | 100110001211212321203 |
5 | 121331313323201011 |
6 | 2214553013115323 |
7 | 143663515063101 |
oct | 20240145467143 |
9 | 3864468825076 |
10 | 1121013100131 |
11 | 3a2467741151 |
12 | 161315028b43 |
13 | 81932328a32 |
14 | 3c38614ac71 |
15 | 1e260639a06 |
hex | 10501966e63 |
1121013100131 has 16 divisors (see below), whose sum is σ = 1498132310400. Its totient is φ = 745618245120.
The previous prime is 1121013100087. The next prime is 1121013100187. The reversal of 1121013100131 is 1310013101211.
It is not a de Polignac number, because 1121013100131 - 217 = 1121012969059 is a prime.
It is a super-2 number, since 2×11210131001312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121013100131.
It is not an unprimeable number, because it can be changed into a prime (1121013100531) 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 15 ways as a sum of consecutive naturals, for example, 22662816 + ... + 22712226.
It is an arithmetic number, because the mean of its divisors is an integer number (93633269400).
Almost surely, 21121013100131 is an apocalyptic number.
1121013100131 is a deficient number, since it is larger than the sum of its proper divisors (377119210269).
1121013100131 is a wasteful number, since it uses less digits than its factorization.
1121013100131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66706.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 1121013100131 its reverse (1310013101211), we get a palindrome (2431026201342).
The spelling of 1121013100131 in words is "one trillion, one hundred twenty-one billion, thirteen million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •