Base | Representation |
---|---|
bin | 10110100100110101… |
… | …11110100100111100 |
3 | 1011021200100001221120 |
4 | 23102122332210330 |
5 | 144310234101022 |
6 | 5322402230540 |
7 | 606231121143 |
oct | 132232764474 |
9 | 34250301846 |
10 | 12120222012 |
11 | 515a605208 |
12 | 2423055450 |
13 | 11b2038802 |
14 | 82d99475a |
15 | 4ae0bbd5c |
hex | 2d26be93c |
12120222012 has 48 divisors (see below), whose sum is σ = 30391038720. Its totient is φ = 3745665792.
The previous prime is 12120221989. The next prime is 12120222019. The reversal of 12120222012 is 21022202121.
It is a junction number, because it is equal to n+sod(n) for n = 12120221982 and 12120222000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120222019) 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, 429712 + ... + 457047.
It is an arithmetic number, because the mean of its divisors is an integer number (633146640).
Almost surely, 212120222012 is an apocalyptic number.
12120222012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12120222012 is an abundant number, since it is smaller than the sum of its proper divisors (18270816708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12120222012 is a wasteful number, since it uses less digits than its factorization.
12120222012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 886850 (or 886848 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12120222012 its reverse (21022202121), we get a palindrome (33142424133).
The spelling of 12120222012 in words is "twelve billion, one hundred twenty million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •