Base | Representation |
---|---|
bin | 10001011101100101101… |
… | …100110001001100001100 |
3 | 11020201102012200022122202 |
4 | 101131211230301030030 |
5 | 124130101020011340 |
6 | 2315135013501032 |
7 | 152461112432204 |
oct | 21354554611414 |
9 | 4221365608582 |
10 | 1200002110220 |
11 | 422a109a8581 |
12 | 17469a341778 |
13 | 8920cb76364 |
14 | 4211a917404 |
15 | 21334ea5c15 |
hex | 11765b3130c |
1200002110220 has 24 divisors (see below), whose sum is σ = 2520232190784. Its totient is φ = 479957461376.
The previous prime is 1200002110169. The next prime is 1200002110249. The reversal of 1200002110220 is 220112000021.
It is a happy number.
It is a super-3 number, since 3×12000021102203 (a number of 37 digits) contains 333 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2484137 + ... + 2927616.
It is an arithmetic number, because the mean of its divisors is an integer number (105009674616).
Almost surely, 21200002110220 is an apocalyptic number.
1200002110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1200002110220 is an abundant number, since it is smaller than the sum of its proper divisors (1320230080564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200002110220 is a wasteful number, since it uses less digits than its factorization.
1200002110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5422849 (or 5422847 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 1200002110220 its reverse (220112000021), we get a palindrome (1420114110241).
The spelling of 1200002110220 in words is "one trillion, two hundred billion, two million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •