Base | Representation |
---|---|
bin | 11101101000100101001000… |
… | …110000010001011101011101 |
3 | 122002110121200101121212220210 |
4 | 131220211020300101131131 |
5 | 114040324420310223401 |
6 | 1141105410135003033 |
7 | 36311114352350436 |
oct | 3550451060213535 |
9 | 562417611555823 |
10 | 130332003211101 |
11 | 3858954607871a |
12 | 1274b270209479 |
13 | 57953417a89a3 |
14 | 24281617dc48d |
15 | 101037b67a4d6 |
hex | 768948c1175d |
130332003211101 has 16 divisors (see below), whose sum is σ = 179835039730368. Its totient is φ = 83894336697600.
The previous prime is 130332003211061. The next prime is 130332003211153. The reversal of 130332003211101 is 101112300233031.
It is a happy number.
It is not a de Polignac number, because 130332003211101 - 213 = 130332003202909 is a prime.
It is a super-2 number, since 2×1303320032111012 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130332003281101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4481520540 + ... + 4481549621.
It is an arithmetic number, because the mean of its divisors is an integer number (11239689983148).
Almost surely, 2130332003211101 is an apocalyptic number.
It is an amenable number.
130332003211101 is a deficient number, since it is larger than the sum of its proper divisors (49503036519267).
130332003211101 is a wasteful number, since it uses less digits than its factorization.
130332003211101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8963070332.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130332003211101 its reverse (101112300233031), we get a palindrome (231444303444132).
The spelling of 130332003211101 in words is "one hundred thirty trillion, three hundred thirty-two billion, three million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •