Base | Representation |
---|---|
bin | 101111110000001110010101… |
… | …111111010001110000100101 |
3 | 1000112121220210210200111220021 |
4 | 233300032111333101300211 |
5 | 210012000301240400401 |
6 | 2022402455254035141 |
7 | 62144411655404251 |
oct | 5760162577216045 |
9 | 1015556723614807 |
10 | 210022122200101 |
11 | 60a12977797772 |
12 | 1b67b83b948ab1 |
13 | 9026002683823 |
14 | 39c11a6c23261 |
15 | 19432561ed2a1 |
hex | bf0395fd1c25 |
210022122200101 has 8 divisors (see below), whose sum is σ = 211628283074208. Its totient is φ = 208416005850000.
The previous prime is 210022122200083. The next prime is 210022122200117. The reversal of 210022122200101 is 101002221220012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210022122200101 - 27 = 210022122199973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210022122200161) 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, 1629930 + ... + 20559691.
It is an arithmetic number, because the mean of its divisors is an integer number (26453535384276).
Almost surely, 2210022122200101 is an apocalyptic number.
It is an amenable number.
210022122200101 is a deficient number, since it is larger than the sum of its proper divisors (1606160874107).
210022122200101 is a wasteful number, since it uses less digits than its factorization.
210022122200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22262003.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210022122200101 its reverse (101002221220012), we get a palindrome (311024343420113).
The spelling of 210022122200101 in words is "two hundred ten trillion, twenty-two billion, one hundred twenty-two million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •