Base | Representation |
---|---|
bin | 10110110000110010101110… |
… | …001100010100011100010010 |
3 | 111010110102110102201210010201 |
4 | 112300302232030110130102 |
5 | 101110200310132401320 |
6 | 552525524113245414 |
7 | 30041465424334366 |
oct | 2660625614243422 |
9 | 433412412653121 |
10 | 100110020200210 |
11 | 2999746a5a3a79 |
12 | b289bab26386a |
13 | 43b2446896427 |
14 | 1aa14ca9732a6 |
15 | b8915855770a |
hex | 5b0cae314712 |
100110020200210 has 64 divisors (see below), whose sum is σ = 193102187777280. Its totient is φ = 37256578007040.
The previous prime is 100110020200163. The next prime is 100110020200249. The reversal of 100110020200210 is 12002020011001.
It is a super-2 number, since 2×1001100202002102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
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, 10970919 + ... + 17904778.
It is an arithmetic number, because the mean of its divisors is an integer number (3017221684020).
Almost surely, 2100110020200210 is an apocalyptic number.
100110020200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100110020200210 is a deficient number, since it is larger than the sum of its proper divisors (92992167577070).
100110020200210 is a wasteful number, since it uses less digits than its factorization.
100110020200210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28876051.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100110020200210 its reverse (12002020011001), we get a palindrome (112112040211211).
The spelling of 100110020200210 in words is "one hundred trillion, one hundred ten billion, twenty million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •