Base | Representation |
---|---|
bin | 10001011101101011101… |
… | …001110100110101011010 |
3 | 11020201200011122100102200 |
4 | 101131223221310311122 |
5 | 124130302103031020 |
6 | 2315152542511030 |
7 | 152463434464002 |
oct | 21355351646532 |
9 | 4221604570380 |
10 | 1200102002010 |
11 | 422a6232577a |
12 | 174707895476 |
13 | 8922777c822 |
14 | 42129cbb002 |
15 | 2133db38590 |
hex | 1176ba74d5a |
1200102002010 has 48 divisors (see below), whose sum is σ = 3120329403360. Its totient is φ = 320020616160.
The previous prime is 1200102001979. The next prime is 1200102002039. The reversal of 1200102002010 is 102002010021.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1200102001983 and 1200102002001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5576181 + ... + 5787399.
It is an arithmetic number, because the mean of its divisors is an integer number (65006862570).
Almost surely, 21200102002010 is an apocalyptic number.
1200102002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1200102002010 is an abundant number, since it is smaller than the sum of its proper divisors (1920227401350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200102002010 is a wasteful number, since it uses less digits than its factorization.
1200102002010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274363 (or 274360 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1200102002010 its reverse (102002010021), we get a palindrome (1302104012031).
The spelling of 1200102002010 in words is "one trillion, two hundred billion, one hundred two million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •