Base | Representation |
---|---|
bin | 10111001111010111100001… |
… | …000010010000111100011000 |
3 | 111101220021202011000211102221 |
4 | 113033113201002100330120 |
5 | 101344111324211211300 |
6 | 1001215045311033424 |
7 | 30346336433625520 |
oct | 2717274102207430 |
9 | 441807664024387 |
10 | 102211112210200 |
11 | 2a627542228154 |
12 | b56924680b874 |
13 | 450560ac51196 |
14 | 1b35089502680 |
15 | bc3b2b57831a |
hex | 5cf5e1090f18 |
102211112210200 has 96 divisors (see below), whose sum is σ = 271607820629760. Its totient is φ = 35041449398400.
The previous prime is 102211112210183. The next prime is 102211112210237. The reversal of 102211112210200 is 2012211112201.
It is a super-2 number, since 2×1022111122102002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18395989 + ... + 23298811.
It is an arithmetic number, because the mean of its divisors is an integer number (2829248131560).
Almost surely, 2102211112210200 is an apocalyptic number.
102211112210200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102211112210200 is an abundant number, since it is smaller than the sum of its proper divisors (169396708419560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102211112210200 is a wasteful number, since it uses less digits than its factorization.
102211112210200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4917737 (or 4917728 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102211112210200 its reverse (2012211112201), we get a palindrome (104223323322401).
The spelling of 102211112210200 in words is "one hundred two trillion, two hundred eleven billion, one hundred twelve million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •