Base | Representation |
---|---|
bin | 10110101111100000110001… |
… | …000010110001100101010100 |
3 | 111010011000022122002101222120 |
4 | 112233200301002301211110 |
5 | 101102230044411401322 |
6 | 552421252053255540 |
7 | 30032231633226156 |
oct | 2657406102614524 |
9 | 433130278071876 |
10 | 100022021200212 |
11 | 299631124428a1 |
12 | b274b306345b0 |
13 | 43a70614ab727 |
14 | 1a9b13d710ad6 |
15 | b86c07bd9a5c |
hex | 5af8310b1954 |
100022021200212 has 96 divisors (see below), whose sum is σ = 255930421942272. Its totient is φ = 30307549700736.
The previous prime is 100022021200183. The next prime is 100022021200243. The reversal of 100022021200212 is 212002120220001.
It is a junction number, because it is equal to n+sod(n) for n = 100022021200191 and 100022021200200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 113451088 + ... + 114329319.
It is an arithmetic number, because the mean of its divisors is an integer number (2665941895232).
Almost surely, 2100022021200212 is an apocalyptic number.
100022021200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100022021200212 is an abundant number, since it is smaller than the sum of its proper divisors (155908400742060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022021200212 is a wasteful number, since it uses less digits than its factorization.
100022021200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227780517 (or 227780515 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 100022021200212 its reverse (212002120220001), we get a palindrome (312024141420213).
The spelling of 100022021200212 in words is "one hundred trillion, twenty-two billion, twenty-one million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •