Base | Representation |
---|---|
bin | 101111101111111011110010… |
… | …100010011111110010110110 |
3 | 1000112120000101101201222020210 |
4 | 233233323302202133302312 |
5 | 210011134001211200042 |
6 | 2022345402350210250 |
7 | 62143105200345651 |
oct | 5757736242376266 |
9 | 1015500341658223 |
10 | 210002200100022 |
11 | 60a05484235050 |
12 | 1b6779bbab3986 |
13 | 9024179182425 |
14 | 39c0237018898 |
15 | 194298c21da9c |
hex | befef289fcb6 |
210002200100022 has 32 divisors (see below), whose sum is σ = 458329668071040. Its totient is φ = 63617162323520.
The previous prime is 210002200099981. The next prime is 210002200100029. The reversal of 210002200100022 is 220001002200012.
It is a junction number, because it is equal to n+sod(n) for n = 210002200099980 and 210002200100007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210002200100029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 496487247 + ... + 496910042.
It is an arithmetic number, because the mean of its divisors is an integer number (14322802127220).
Almost surely, 2210002200100022 is an apocalyptic number.
210002200100022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210002200100022 is an abundant number, since it is smaller than the sum of its proper divisors (248327467971018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210002200100022 is a wasteful number, since it uses less digits than its factorization.
210002200100022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 993400508.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 210002200100022 its reverse (220001002200012), we get a palindrome (430003202300034).
The spelling of 210002200100022 in words is "two hundred ten trillion, two billion, two hundred million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •