Base | Representation |
---|---|
bin | 11011010010101011110111… |
… | …000011110101010011011100 |
3 | 120201222212202202012011111210 |
4 | 123102223313003311103130 |
5 | 111213043101030444012 |
6 | 1103141341330344420 |
7 | 34165655351436531 |
oct | 3322536703652334 |
9 | 521885682164453 |
10 | 120031301031132 |
11 | 35277a9724a187 |
12 | 11566a53a2b110 |
13 | 51c8b981cb17a |
14 | 218d7901c6d88 |
15 | dd24525c523c |
hex | 6d2af70f54dc |
120031301031132 has 96 divisors (see below), whose sum is σ = 285672184490560. Its totient is φ = 39215286190080.
The previous prime is 120031301031091. The next prime is 120031301031139. The reversal of 120031301031132 is 231130103130021.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 120031301031099 and 120031301031108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120031301031139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 676490844 + ... + 676668252.
Almost surely, 2120031301031132 is an apocalyptic number.
120031301031132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120031301031132 is an abundant number, since it is smaller than the sum of its proper divisors (165640883459428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120031301031132 is a wasteful number, since it uses less digits than its factorization.
120031301031132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180743 (or 180741 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 120031301031132 its reverse (231130103130021), we get a palindrome (351161404161153).
The spelling of 120031301031132 in words is "one hundred twenty trillion, thirty-one billion, three hundred one million, thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •