Base | Representation |
---|---|
bin | 10111001111010111011000… |
… | …001101010001010000101000 |
3 | 111101220021100211100001122000 |
4 | 113033113120031101100220 |
5 | 101344111023302201021 |
6 | 1001215022500331000 |
7 | 30346332654666663 |
oct | 2717273015212050 |
9 | 441807324301560 |
10 | 102210964100136 |
11 | 2a627476666941 |
12 | b5692050a3a60 |
13 | 45055b63645a8 |
14 | 1b3507398a6da |
15 | bc3b1d56db26 |
hex | 5cf5d8351428 |
102210964100136 has 64 divisors (see below), whose sum is σ = 283971625526400. Its totient is φ = 34064047670400.
The previous prime is 102210964100111. The next prime is 102210964100191. The reversal of 102210964100136 is 631001469012201.
It is a happy number.
102210964100136 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 1 + 0 + 9 + 641 + 0 + 0 + 1 + 3 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 102210964100136.
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, 42391525 + ... + 44737716.
It is an arithmetic number, because the mean of its divisors is an integer number (4437056648850).
Almost surely, 2102210964100136 is an apocalyptic number.
It is an amenable number.
102210964100136 is an abundant number, since it is smaller than the sum of its proper divisors (181760661426264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102210964100136 is a wasteful number, since it uses less digits than its factorization.
102210964100136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87134687 (or 87134677 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The spelling of 102210964100136 in words is "one hundred two trillion, two hundred ten billion, nine hundred sixty-four million, one hundred thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •