Base | Representation |
---|---|
bin | 1011000001011001010… |
… | …1001100100000110100 |
3 | 200002202100111000121000 |
4 | 2300112111030200310 |
5 | 11100243410403202 |
6 | 222553200323300 |
7 | 16452230531400 |
oct | 2602625144064 |
9 | 602670430530 |
10 | 189353216052 |
11 | 73338a54900 |
12 | 30846013530 |
13 | 14b18635810 |
14 | 92440b8100 |
15 | 4dd390691c |
hex | 2c1654c834 |
189353216052 has 1296 divisors, whose sum is σ = 723086696640. Its totient is φ = 42415591680.
The previous prime is 189353216023. The next prime is 189353216111. The reversal of 189353216052 is 250612353981.
189353216052 is a `hidden beast` number, since 1 + 8 + 9 + 3 + 5 + 32 + 1 + 605 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 189353215989 and 189353216007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 431 ways as a sum of consecutive naturals, for example, 4403563143 + ... + 4403563185.
Almost surely, 2189353216052 is an apocalyptic number.
189353216052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 189353216052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (361543348320).
189353216052 is an abundant number, since it is smaller than the sum of its proper divisors (533733480588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
189353216052 is a wasteful number, since it uses less digits than its factorization.
189353216052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 45.
The spelling of 189353216052 in words is "one hundred eighty-nine billion, three hundred fifty-three million, two hundred sixteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •