Base | Representation |
---|---|
bin | 11111110101111110000… |
… | …010111101100101000110 |
3 | 21202012021010012010100100 |
4 | 133311332002331211012 |
5 | 241323020240400043 |
6 | 4353134121224530 |
7 | 314044644051600 |
oct | 37657602754506 |
9 | 7665233163310 |
10 | 2188253059398 |
11 | 77403a89370a |
12 | 2b4121632146 |
13 | 12b474c92b03 |
14 | 77caa7c8170 |
15 | 3bdc501bcd3 |
hex | 1fd7e0bd946 |
2188253059398 has 36 divisors (see below), whose sum is σ = 5515290876420. Its totient is φ = 625215159576.
The previous prime is 2188253059397. The next prime is 2188253059459. The reversal of 2188253059398 is 8939503528812.
2188253059398 is a `hidden beast` number, since 2 + 1 + 8 + 8 + 2 + 5 + 30 + 593 + 9 + 8 = 666.
It is a super-2 number, since 2×21882530593982 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2188253059393) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1240505388 + ... + 1240507151.
It is an arithmetic number, because the mean of its divisors is an integer number (153202524345).
Almost surely, 22188253059398 is an apocalyptic number.
2188253059398 is an abundant number, since it is smaller than the sum of its proper divisors (3327037817022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2188253059398 is a wasteful number, since it uses less digits than its factorization.
2188253059398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2481012561 (or 2481012551 counting only the distinct ones).
The product of its (nonzero) digits is 37324800, while the sum is 63.
The spelling of 2188253059398 in words is "two trillion, one hundred eighty-eight billion, two hundred fifty-three million, fifty-nine thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •