Base | Representation |
---|---|
bin | 101111110010111101100001… |
… | …100011010101001111000100 |
3 | 1000120021220022201210121121012 |
4 | 233302331201203111033010 |
5 | 210023041013040120400 |
6 | 2023025124204341352 |
7 | 62164121145113420 |
oct | 5762754143251704 |
9 | 1016256281717535 |
10 | 210210221020100 |
11 | 60a85721662214 |
12 | 1b6b0195844858 |
13 | 903a97b15a852 |
14 | 39ca32c48bb80 |
15 | 19480b4921d35 |
hex | bf2f618d53c4 |
210210221020100 has 36 divisors (see below), whose sum is σ = 521321348131584. Its totient is φ = 72072075778080.
The previous prime is 210210221020067. The next prime is 210210221020133. The reversal of 210210221020100 is 1020122012012.
It is an interprime number because it is at equal distance from previous prime (210210221020067) and next prime (210210221020133).
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 150150157172 + ... + 150150158571.
Almost surely, 2210210221020100 is an apocalyptic number.
210210221020100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210210221020100 is an abundant number, since it is smaller than the sum of its proper divisors (311111127111484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210210221020100 is a wasteful number, since it uses less digits than its factorization.
210210221020100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300300315764 (or 300300315757 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 210210221020100 its reverse (1020122012012), we get a palindrome (211230343032112).
The spelling of 210210221020100 in words is "two hundred ten trillion, two hundred ten billion, two hundred twenty-one million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •