Base | Representation |
---|---|
bin | 110111111100001101… |
… | …1010000010000010111 |
3 | 102111002012120110120220 |
4 | 1233320123100100113 |
5 | 3432012243323111 |
6 | 131104325525423 |
7 | 11451661150134 |
oct | 1577033202027 |
9 | 374065513526 |
10 | 120132011031 |
11 | 46a4742aa4a |
12 | 1b347b73873 |
13 | b4366582c6 |
14 | 5b58aab58b |
15 | 31d187ee06 |
hex | 1bf86d0417 |
120132011031 has 16 divisors (see below), whose sum is σ = 165759029760. Its totient is φ = 77298490080.
The previous prime is 120132010997. The next prime is 120132011059. The reversal of 120132011031 is 130110231021.
It is a happy number.
It is not a de Polignac number, because 120132011031 - 26 = 120132010967 is a prime.
It is a super-2 number, since 2×1201320110312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 120132011031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120132016031) 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 in 15 ways as a sum of consecutive naturals, for example, 4555 + ... + 490188.
It is an arithmetic number, because the mean of its divisors is an integer number (10359939360).
Almost surely, 2120132011031 is an apocalyptic number.
120132011031 is a deficient number, since it is larger than the sum of its proper divisors (45627018729).
120132011031 is a wasteful number, since it uses less digits than its factorization.
120132011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497566.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 120132011031 its reverse (130110231021), we get a palindrome (250242242052).
The spelling of 120132011031 in words is "one hundred twenty billion, one hundred thirty-two million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •