Base | Representation |
---|---|
bin | 11101000111000001001… |
… | …00100110000001110000 |
3 | 10112121200122221122211020 |
4 | 32203200210212001300 |
5 | 112341402211231000 |
6 | 2043252515215440 |
7 | 132155614406541 |
oct | 16434044460160 |
9 | 3477618848736 |
10 | 1000200102000 |
11 | 356200978550 |
12 | 141a18ba7580 |
13 | 7341a88a3a8 |
14 | 365a4c544c8 |
15 | 1b03e0e0ba0 |
hex | e8e0926070 |
1000200102000 has 160 divisors (see below), whose sum is σ = 3517794918144. Its totient is φ = 242472736000.
The previous prime is 1000200101987. The next prime is 1000200102017. The reversal of 1000200102000 is 2010020001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1000200102000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7511274 + ... + 7643273.
Almost surely, 21000200102000 is an apocalyptic number.
1000200102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000200102000 is an abundant number, since it is smaller than the sum of its proper divisors (2517594816144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000200102000 is a wasteful number, since it uses less digits than its factorization.
1000200102000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15154584 (or 15154568 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 1000200102000 its reverse (2010020001), we get a palindrome (1002210122001).
The spelling of 1000200102000 in words is "one trillion, two hundred million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •