Base | Representation |
---|---|
bin | 11011010010011001111001… |
… | …111000101111011001111000 |
3 | 120201221001000002121022001212 |
4 | 123102121321320233121320 |
5 | 111212234104400232300 |
6 | 1103124432242502252 |
7 | 34164403521650303 |
oct | 3322317170573170 |
9 | 521831002538055 |
10 | 120012021102200 |
11 | 3526a8a3229217 |
12 | 11563173064988 |
13 | 51c7114a6c4b6 |
14 | 218c8817c1b3a |
15 | dd1bc4b93935 |
hex | 6d2679e2f678 |
120012021102200 has 24 divisors (see below), whose sum is σ = 279027949063080. Its totient is φ = 48004808440800.
The previous prime is 120012021102131. The next prime is 120012021102203. The reversal of 120012021102200 is 2201120210021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120012021102203) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 300030052556 + ... + 300030052955.
It is an arithmetic number, because the mean of its divisors is an integer number (11626164544295).
Almost surely, 2120012021102200 is an apocalyptic number.
120012021102200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120012021102200 is an abundant number, since it is smaller than the sum of its proper divisors (159015927960880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120012021102200 is a wasteful number, since it uses less digits than its factorization.
120012021102200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600060105527 (or 600060105518 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120012021102200 its reverse (2201120210021), we get a palindrome (122213141312221).
The spelling of 120012021102200 in words is "one hundred twenty trillion, twelve billion, twenty-one million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •