Base | Representation |
---|---|
bin | 101111110001010111000011… |
… | …111010100000010011010101 |
3 | 1000112220101100022211000111000 |
4 | 233301113003322200103111 |
5 | 210014240203220042323 |
6 | 2022502411141333513 |
7 | 62153144603613060 |
oct | 5761270372402325 |
9 | 1015811308730430 |
10 | 210100202112213 |
11 | 60a42aa4878356 |
12 | 1b6929b0707299 |
13 | 9030496a7065a |
14 | 39c4c929858d7 |
15 | 19452c5d41e43 |
hex | bf15c3ea04d5 |
210100202112213 has 128 divisors (see below), whose sum is σ = 378203544576000. Its totient is φ = 112597873459200.
The previous prime is 210100202112211. The next prime is 210100202112233. The reversal of 210100202112213 is 312211202001012.
210100202112213 is a `hidden beast` number, since 210 + 1 + 0 + 0 + 20 + 211 + 221 + 3 = 666.
It is not a de Polignac number, because 210100202112213 - 21 = 210100202112211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210100202112211) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3205792981 + ... + 3205858517.
It is an arithmetic number, because the mean of its divisors is an integer number (2954715192000).
Almost surely, 2210100202112213 is an apocalyptic number.
It is an amenable number.
210100202112213 is a deficient number, since it is larger than the sum of its proper divisors (168103342463787).
210100202112213 is a wasteful number, since it uses less digits than its factorization.
210100202112213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74512 (or 74506 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 210100202112213 its reverse (312211202001012), we get a palindrome (522311404113225).
The spelling of 210100202112213 in words is "two hundred ten trillion, one hundred billion, two hundred two million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •