Base | Representation |
---|---|
bin | 110111111100001101… |
… | …1101000011010111101 |
3 | 102111002012202111100220 |
4 | 1233320123220122331 |
5 | 3432012310010023 |
6 | 131104332011553 |
7 | 11451662041536 |
oct | 1577033503275 |
9 | 374065674326 |
10 | 120132110013 |
11 | 46a47498353 |
12 | 1b348000bb9 |
13 | b436691386 |
14 | 5b58ad568d |
15 | 31d189e3e3 |
hex | 1bf86e86bd |
120132110013 has 8 divisors (see below), whose sum is σ = 160321369728. Its totient is φ = 80015461824.
The previous prime is 120132110011. The next prime is 120132110029. The reversal of 120132110013 is 310011231021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120132110013 - 21 = 120132110011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120132109974 and 120132110001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120132110011) 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 7 ways as a sum of consecutive naturals, for example, 18149020 + ... + 18155637.
It is an arithmetic number, because the mean of its divisors is an integer number (20040171216).
Almost surely, 2120132110013 is an apocalyptic number.
It is an amenable number.
120132110013 is a deficient number, since it is larger than the sum of its proper divisors (40189259715).
120132110013 is a wasteful number, since it uses less digits than its factorization.
120132110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36305763.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 120132110013 its reverse (310011231021), we get a palindrome (430143341034).
The spelling of 120132110013 in words is "one hundred twenty billion, one hundred thirty-two million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •