Base | Representation |
---|---|
bin | 110111111110100110… |
… | …0011110001011111100 |
3 | 102111021210010110000120 |
4 | 1233331030132023330 |
5 | 3432143234201022 |
6 | 131120304454540 |
7 | 11453652220245 |
oct | 1577514361374 |
9 | 374253113016 |
10 | 120212022012 |
11 | 46a88609425 |
12 | 1b36a91a450 |
13 | b44a0c0694 |
14 | 5b65577ccc |
15 | 31d88d6d5c |
hex | 1bfd31e2fc |
120212022012 has 96 divisors (see below), whose sum is σ = 289874930688. Its totient is φ = 38752272384.
The previous prime is 120212022001. The next prime is 120212022023. The reversal of 120212022012 is 210220212021.
It is an interprime number because it is at equal distance from previous prime (120212022001) and next prime (120212022023).
It is a junction number, because it is equal to n+sod(n) for n = 120212021982 and 120212022000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45242188 + ... + 45244844.
It is an arithmetic number, because the mean of its divisors is an integer number (3019530528).
Almost surely, 2120212022012 is an apocalyptic number.
120212022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120212022012 is an abundant number, since it is smaller than the sum of its proper divisors (169662908676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120212022012 is a wasteful number, since it uses less digits than its factorization.
120212022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3635 (or 3633 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 120212022012 its reverse (210220212021), we get a palindrome (330432234033).
The spelling of 120212022012 in words is "one hundred twenty billion, two hundred twelve million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •