Base | Representation |
---|---|
bin | 10000011100100000011… |
… | …101011111010000101101 |
3 | 11000001001002001002212122 |
4 | 100130200131133100231 |
5 | 122003441433444411 |
6 | 2223100451042325 |
7 | 144435311001011 |
oct | 20344035372055 |
9 | 4001032032778 |
10 | 1130120999981 |
11 | 3a631092a106 |
12 | 1630372a03a5 |
13 | 8275425749c |
14 | 3c9aba0c541 |
15 | 1e5e502b9db |
hex | 1072075f42d |
1130120999981 has 2 divisors, whose sum is σ = 1130120999982. Its totient is φ = 1130120999980.
The previous prime is 1130120999939. The next prime is 1130121000013. The reversal of 1130120999981 is 1899990210311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1127293951081 + 2827048900 = 1061741^2 + 53170^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1130120999981 is a prime.
It is a super-2 number, since 2×11301209999812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130120999911) 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 as a sum of consecutive naturals, namely, 565060499990 + 565060499991.
It is an arithmetic number, because the mean of its divisors is an integer number (565060499991).
Almost surely, 21130120999981 is an apocalyptic number.
It is an amenable number.
1130120999981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130120999981 is an equidigital number, since it uses as much as digits as its factorization.
1130120999981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 314928, while the sum is 53.
The spelling of 1130120999981 in words is "one trillion, one hundred thirty billion, one hundred twenty million, nine hundred ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •