Base | Representation |
---|---|
bin | 111000000001111011… |
… | …1101101011100111111 |
3 | 102111120120212112102100 |
4 | 1300003313231130333 |
5 | 3432410422120111 |
6 | 131135345200143 |
7 | 11456512203135 |
oct | 1600367553477 |
9 | 374516775370 |
10 | 120324020031 |
11 | 47035855176 |
12 | 1b3a0330053 |
13 | b4673752b7 |
14 | 5b763ad755 |
15 | 31e365b756 |
hex | 1c03ded73f |
120324020031 has 96 divisors (see below), whose sum is σ = 190093662720. Its totient is φ = 73156608000.
The previous prime is 120324019979. The next prime is 120324020071. The reversal of 120324020031 is 130020423021.
It is not a de Polignac number, because 120324020031 - 227 = 120189802303 is a prime.
It is a super-2 number, since 2×1203240200312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120324019986 and 120324020013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120324020071) 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 95 ways as a sum of consecutive naturals, for example, 59653935 + ... + 59655951.
It is an arithmetic number, because the mean of its divisors is an integer number (1980142320).
Almost surely, 2120324020031 is an apocalyptic number.
120324020031 is a deficient number, since it is larger than the sum of its proper divisors (69769642689).
120324020031 is a wasteful number, since it uses less digits than its factorization.
120324020031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2257 (or 2254 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 120324020031 its reverse (130020423021), we get a palindrome (250344443052).
The spelling of 120324020031 in words is "one hundred twenty billion, three hundred twenty-four million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •