Base | Representation |
---|---|
bin | 101110100010000001… |
… | …1011010100100000000 |
3 | 100112221000101102201200 |
4 | 1131010003122210000 |
5 | 3114122023244403 |
6 | 113523320501200 |
7 | 10135154634531 |
oct | 1350403324400 |
9 | 315830342650 |
10 | 99925993728 |
11 | 394186890a0 |
12 | 1744901a800 |
13 | 956639a552 |
14 | 4b9d2b8688 |
15 | 28ec9bbca3 |
hex | 17440da900 |
99925993728 has 216 divisors, whose sum is σ = 315898564800. Its totient is φ = 30126919680.
The previous prime is 99925993723. The next prime is 99925993771. The reversal of 99925993728 is 82739952999.
99925993728 is a `hidden beast` number, since 9 + 9 + 9 + 2 + 599 + 3 + 7 + 28 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is not an unprimeable number, because it can be changed into a prime (99925993723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5033550 + ... + 5053362.
Almost surely, 299925993728 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 99925993728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157949282400).
99925993728 is an abundant number, since it is smaller than the sum of its proper divisors (215972571072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
99925993728 is a wasteful number, since it uses less digits than its factorization.
99925993728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20045 (or 20028 counting only the distinct ones).
The product of its digits is 198404640, while the sum is 72.
The spelling of 99925993728 in words is "ninety-nine billion, nine hundred twenty-five million, nine hundred ninety-three thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •