Base | Representation |
---|---|
bin | 10111001111001101001011… |
… | …111101011010110101010100 |
3 | 111101212020010012100010222020 |
4 | 113033031023331122311110 |
5 | 101343421120411401322 |
6 | 1001210012552133140 |
7 | 30345464540612445 |
oct | 2717151375326524 |
9 | 441766105303866 |
10 | 102200021200212 |
11 | 2a6228706891a1 |
12 | b5670703971b0 |
13 | 450456120cc90 |
14 | 1b347165012cc |
15 | bc36cca0d05c |
hex | 5cf34bf5ad54 |
102200021200212 has 48 divisors (see below), whose sum is σ = 256825034289600. Its totient is φ = 31444357356288.
The previous prime is 102200021200111. The next prime is 102200021200357. The reversal of 102200021200212 is 212002120002201.
It is a junction number, because it is equal to n+sod(n) for n = 102200021200191 and 102200021200200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16050618 + ... + 21494705.
It is an arithmetic number, because the mean of its divisors is an integer number (5350521547700).
Almost surely, 2102200021200212 is an apocalyptic number.
102200021200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102200021200212 is an abundant number, since it is smaller than the sum of its proper divisors (154625013089388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102200021200212 is a wasteful number, since it uses less digits than its factorization.
102200021200212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37562792 (or 37562790 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102200021200212 its reverse (212002120002201), we get a palindrome (314202141202413).
The spelling of 102200021200212 in words is "one hundred two trillion, two hundred billion, twenty-one million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •