Base | Representation |
---|---|
bin | 10111010011100000111000… |
… | …011110110011011000000000 |
3 | 111102220112012202101112111101 |
4 | 113103200320132303120000 |
5 | 101413243401032304332 |
6 | 1001554011203424144 |
7 | 30406044411642454 |
oct | 2723407036633000 |
9 | 442815182345441 |
10 | 102496047150592 |
11 | 2a727369606167 |
12 | b5b4506985054 |
13 | 4526449904b24 |
14 | 1b44b99926664 |
15 | bcb256370ae7 |
hex | 5d38387b3600 |
102496047150592 has 80 divisors (see below), whose sum is σ = 211422308499072. Its totient is φ = 49589181480960.
The previous prime is 102496047150589. The next prime is 102496047150613. The reversal of 102496047150592 is 295051740694201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 139895488 + ... + 140626240.
Almost surely, 2102496047150592 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102496047150592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105711154249536).
102496047150592 is an abundant number, since it is smaller than the sum of its proper divisors (108926261348480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102496047150592 is an frugal number, since it uses more digits than its factorization.
102496047150592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739639 (or 739623 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 102496047150592 in words is "one hundred two trillion, four hundred ninety-six billion, forty-seven million, one hundred fifty thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •