Base | Representation |
---|---|
bin | 110111111110010011… |
… | …0001111111001011100 |
3 | 102111021002021101011110 |
4 | 1233330212033321130 |
5 | 3432133203031022 |
6 | 131115310022020 |
7 | 11453501105361 |
oct | 1577446177134 |
9 | 374232241143 |
10 | 120202002012 |
11 | 46a82995234 |
12 | 1b3674a7910 |
13 | b447cc29a1 |
14 | 5b640ca468 |
15 | 31d7aa800c |
hex | 1bfc98fe5c |
120202002012 has 48 divisors (see below), whose sum is σ = 287307256320. Its totient is φ = 39100689792.
The previous prime is 120202002007. The next prime is 120202002013. The reversal of 120202002012 is 210200202021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120202002013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 522628 + ... + 716619.
It is an arithmetic number, because the mean of its divisors is an integer number (5985567840).
Almost surely, 2120202002012 is an apocalyptic number.
120202002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120202002012 is an abundant number, since it is smaller than the sum of its proper divisors (167105254308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120202002012 is a wasteful number, since it uses less digits than its factorization.
120202002012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1239450 (or 1239448 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 120202002012 its reverse (210200202021), we get a palindrome (330402204033).
Subtracting 120202002012 from its reverse (210200202021), we obtain a square (89998200009 = 2999972).
The spelling of 120202002012 in words is "one hundred twenty billion, two hundred two million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •