Base | Representation |
---|---|
bin | 10111001111100100100011… |
… | …100001001110100011010000 |
3 | 111101221121212212002111212000 |
4 | 113033210203201032203100 |
5 | 101344324012301300013 |
6 | 1001225322434234000 |
7 | 30350343404425044 |
oct | 2717444341164320 |
9 | 441847785074760 |
10 | 102225112525008 |
11 | 2a632477020960 |
12 | b56bab3425900 |
13 | 4506a2c640425 |
14 | 1b35a16a5c024 |
15 | bc419a71e973 |
hex | 5cf92384e8d0 |
102225112525008 has 160 divisors (see below), whose sum is σ = 327542996858880. Its totient is φ = 30256904280960.
The previous prime is 102225112524991. The next prime is 102225112525027. The reversal of 102225112525008 is 800525211522201.
102225112525008 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 25 + 1 + 125 + 2 + 500 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 249935416 + ... + 250344087.
It is an arithmetic number, because the mean of its divisors is an integer number (2047143730368).
Almost surely, 2102225112525008 is an apocalyptic number.
102225112525008 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
102225112525008 is an abundant number, since it is smaller than the sum of its proper divisors (225317884333872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102225112525008 is a wasteful number, since it uses less digits than its factorization.
102225112525008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 500279574 (or 500279562 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 36.
The spelling of 102225112525008 in words is "one hundred two trillion, two hundred twenty-five billion, one hundred twelve million, five hundred twenty-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •