Base | Representation |
---|---|
bin | 101110101010011111… |
… | …1100101000110101010 |
3 | 100120122211011122211000 |
4 | 1131110333211012222 |
5 | 3120212302413002 |
6 | 114011432215430 |
7 | 10145205440262 |
oct | 1352477450652 |
9 | 316584148730 |
10 | 100210201002 |
11 | 3955405623a |
12 | 1750823a576 |
13 | 95b0228c32 |
14 | 4bc8d3a7a2 |
15 | 291790b61c |
hex | 1754fe51aa |
100210201002 has 64 divisors (see below), whose sum is σ = 235952179200. Its totient is φ = 31416698880.
The previous prime is 100210200971. The next prime is 100210201031. The reversal of 100210201002 is 200102012001.
It is a super-2 number, since 2×1002102010022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
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, 1313274 + ... + 1387482.
It is an arithmetic number, because the mean of its divisors is an integer number (3686752800).
Almost surely, 2100210201002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100210201002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117976089600).
100210201002 is an abundant number, since it is smaller than the sum of its proper divisors (135741978198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100210201002 is a wasteful number, since it uses less digits than its factorization.
100210201002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75708 (or 75702 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100210201002 its reverse (200102012001), we get a palindrome (300312213003).
The spelling of 100210201002 in words is "one hundred billion, two hundred ten million, two hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •