Base | Representation |
---|---|
bin | 10111001111100001110000… |
… | …101011100001011001110000 |
3 | 111101221100010202021020020221 |
4 | 113033201300223201121300 |
5 | 101344301341144231000 |
6 | 1001224105012542424 |
7 | 30350206142311102 |
oct | 2717416053413160 |
9 | 441840122236227 |
10 | 102222112102000 |
11 | 2a6311773a1720 |
12 | b56b3b6621a14 |
13 | 4506671b3b4b7 |
14 | 1b35810385572 |
15 | bc40720e561a |
hex | 5cf870ae1670 |
102222112102000 has 160 divisors (see below), whose sum is σ = 269651333585088. Its totient is φ = 37170576000000.
The previous prime is 102222112101973. The next prime is 102222112102043. The reversal of 102222112102000 is 201211222201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1305462850 + ... + 1305541150.
Almost surely, 2102222112102000 is an apocalyptic number.
102222112102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102222112102000 is an abundant number, since it is smaller than the sum of its proper divisors (167429221483088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102222112102000 is a wasteful number, since it uses less digits than its factorization.
102222112102000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137676 (or 137660 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102222112102000 its reverse (201211222201), we get a palindrome (102423323324201).
The spelling of 102222112102000 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred twelve million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •