Base | Representation |
---|---|
bin | 10111001100100110011110… |
… | …110010011011010100010000 |
3 | 111101020010002110010211210200 |
4 | 113030212132302123110100 |
5 | 101333003023140413404 |
6 | 1000551451030255200 |
7 | 30326530015332336 |
oct | 2714463662332420 |
9 | 441203073124720 |
10 | 102021022201104 |
11 | 2a563966393886 |
12 | b538435ab7500 |
13 | 44c0705a96366 |
14 | 1b29bb5633b56 |
15 | bbdc03132839 |
hex | 5cc99ec9b510 |
102021022201104 has 120 divisors (see below), whose sum is σ = 294479051098752. Its totient is φ = 32953914681600.
The previous prime is 102021022201081. The next prime is 102021022201127. The reversal of 102021022201104 is 401102220120201.
It is an interprime number because it is at equal distance from previous prime (102021022201081) and next prime (102021022201127).
It is a Harshad number since it is a multiple of its sum of digits (18).
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 23 ways as a sum of consecutive naturals, for example, 73940334 + ... + 75307469.
Almost surely, 2102021022201104 is an apocalyptic number.
It is an amenable number.
102021022201104 is an abundant number, since it is smaller than the sum of its proper divisors (192458028897648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102021022201104 is a wasteful number, since it uses less digits than its factorization.
102021022201104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149247965 (or 149247956 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 102021022201104 its reverse (401102220120201), we get a palindrome (503123242321305).
The spelling of 102021022201104 in words is "one hundred two trillion, twenty-one billion, twenty-two million, two hundred one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.461 sec. • engine limits •