Base | Representation |
---|---|
bin | 10111000010100011000000… |
… | …101111000010001000110000 |
3 | 111021210001201000220010122010 |
4 | 113002203000233002020300 |
5 | 101240143022103032344 |
6 | 555302223424442520 |
7 | 30225600250464234 |
oct | 2702430057021060 |
9 | 437701630803563 |
10 | 101330102002224 |
11 | 2a317944a01157 |
12 | b446552179440 |
13 | 447050679a404 |
14 | 1b045901985c4 |
15 | baac6626b8b9 |
hex | 5c28c0bc2230 |
101330102002224 has 20 divisors (see below), whose sum is σ = 261769430172536. Its totient is φ = 33776700667392.
The previous prime is 101330102002153. The next prime is 101330102002249. The reversal of 101330102002224 is 422200201033101.
It is a super-2 number, since 2×1013301020022242 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101330102002224.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1055521895809 + ... + 1055521895904.
Almost surely, 2101330102002224 is an apocalyptic number.
It is an amenable number.
101330102002224 is an abundant number, since it is smaller than the sum of its proper divisors (160439328170312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101330102002224 is a wasteful number, since it uses less digits than its factorization.
101330102002224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2111043791724 (or 2111043791718 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 101330102002224 its reverse (422200201033101), we get a palindrome (523530303035325).
The spelling of 101330102002224 in words is "one hundred one trillion, three hundred thirty billion, one hundred two million, two thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •