Base | Representation |
---|---|
bin | 10110101111001110010011… |
… | …101010110000000000100010 |
3 | 111010002010011022220102200101 |
4 | 112233032103222300000202 |
5 | 101101414001424311320 |
6 | 552404213230013014 |
7 | 30030630523336522 |
oct | 2657162352600042 |
9 | 433063138812611 |
10 | 100002201010210 |
11 | 29955771466784 |
12 | b27111a94716a |
13 | 43a522313c355 |
14 | 1a9a1bd273682 |
15 | b86447b3ac0a |
hex | 5af393ab0022 |
100002201010210 has 16 divisors (see below), whose sum is σ = 180673121532600. Its totient is φ = 39852178245376.
The previous prime is 100002201010121. The next prime is 100002201010211. The reversal of 100002201010210 is 12010102200001.
It can be written as a sum of positive squares in 4 ways, for example, as 64705662504289 + 35296538505921 = 8043983^2 + 5941089^2 .
It is a super-3 number, since 3×1000022010102103 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (100002201010211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18587767015 + ... + 18587772394.
Almost surely, 2100002201010210 is an apocalyptic number.
100002201010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100002201010210 is a deficient number, since it is larger than the sum of its proper divisors (80670920522390).
100002201010210 is a wasteful number, since it uses less digits than its factorization.
100002201010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37175539685.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100002201010210 its reverse (12010102200001), we get a palindrome (112012303210211).
The spelling of 100002201010210 in words is "one hundred trillion, two billion, two hundred one million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •