Base | Representation |
---|---|
bin | 110111111011111110… |
… | …1111001000110011100 |
3 | 102111001200002102021010 |
4 | 1233313331321012130 |
5 | 3432003311022022 |
6 | 131103452535220 |
7 | 11451535551633 |
oct | 1576775710634 |
9 | 374050072233 |
10 | 120124314012 |
11 | 46a4305307a |
12 | 1b345481510 |
13 | b434b91a61 |
14 | 5b57a6651a |
15 | 31d0d5e50c |
hex | 1bf7f7919c |
120124314012 has 12 divisors (see below), whose sum is σ = 280290066056. Its totient is φ = 40041438000.
The previous prime is 120124313993. The next prime is 120124314041. The reversal of 120124314012 is 210413421021.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1201243140122 (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 120124314012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5005179739 + ... + 5005179762.
Almost surely, 2120124314012 is an apocalyptic number.
120124314012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120124314012 is an abundant number, since it is smaller than the sum of its proper divisors (160165752044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120124314012 is a wasteful number, since it uses less digits than its factorization.
120124314012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10010359508 (or 10010359506 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 120124314012 its reverse (210413421021), we get a palindrome (330537735033).
The spelling of 120124314012 in words is "one hundred twenty billion, one hundred twenty-four million, three hundred fourteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •