Base | Representation |
---|---|
bin | 11101100100001101110101… |
… | …001000110001111000010101 |
3 | 122001101221120122001110010011 |
4 | 131210031311020301320111 |
5 | 114020421220112402013 |
6 | 1140315531103000221 |
7 | 36250336442223406 |
oct | 3544156510617025 |
9 | 561357518043104 |
10 | 130032100122133 |
11 | 38483338653090 |
12 | 12701113299071 |
13 | 5772c88a7b8b1 |
14 | 24178314c59ad |
15 | 1007677760c3d |
hex | 764375231e15 |
130032100122133 has 16 divisors (see below), whose sum is σ = 144533514715200. Its totient is φ = 115977523118080.
The previous prime is 130032100122107. The next prime is 130032100122139. The reversal of 130032100122133 is 331221001230031.
It is a cyclic number.
It is not a de Polignac number, because 130032100122133 - 217 = 130032099991061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130032100122139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19145958 + ... + 25032616.
It is an arithmetic number, because the mean of its divisors is an integer number (9033344669700).
Almost surely, 2130032100122133 is an apocalyptic number.
It is an amenable number.
130032100122133 is a deficient number, since it is larger than the sum of its proper divisors (14501414593067).
130032100122133 is a wasteful number, since it uses less digits than its factorization.
130032100122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5924612.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 130032100122133 its reverse (331221001230031), we get a palindrome (461253101352164).
The spelling of 130032100122133 in words is "one hundred thirty trillion, thirty-two billion, one hundred million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •