Base | Representation |
---|---|
bin | 10110101111010101110001… |
… | …000010101100101101110010 |
3 | 111010002212211111021021222101 |
4 | 112233111301002230231302 |
5 | 101102031402231121320 |
6 | 552412020050531014 |
7 | 30031333143654100 |
oct | 2657256102545562 |
9 | 433085744237871 |
10 | 100010210020210 |
11 | 29959101328506 |
12 | b272794b96a6a |
13 | 43a5bcb4b8519 |
14 | 1a9a73cc04c70 |
15 | b86765d15c0a |
hex | 5af5710acb72 |
100010210020210 has 96 divisors (see below), whose sum is σ = 211595960847168. Its totient is φ = 33931502236800.
The previous prime is 100010210020187. The next prime is 100010210020211. The reversal of 100010210020210 is 12020012010001.
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 (100010210020211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 91856637 + ... + 92939023.
It is an arithmetic number, because the mean of its divisors is an integer number (2204124592158).
Almost surely, 2100010210020210 is an apocalyptic number.
100010210020210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100010210020210 is an abundant number, since it is smaller than the sum of its proper divisors (111585750826958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010210020210 is a wasteful number, since it uses less digits than its factorization.
100010210020210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084376 (or 1084369 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100010210020210 its reverse (12020012010001), we get a palindrome (112030222030211).
The spelling of 100010210020210 in words is "one hundred trillion, ten billion, two hundred ten million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •