Base | Representation |
---|---|
bin | 101010011110100110… |
… | …010000000000000000 |
3 | 11100201200012110202100 |
4 | 222132212100000000 |
5 | 1221402242000341 |
6 | 32541515150400 |
7 | 3203161565640 |
oct | 523646200000 |
9 | 140650173670 |
10 | 45610500096 |
11 | 18385a35887 |
12 | 8a0aa45400 |
13 | 43bb5450c5 |
14 | 22c978a520 |
15 | 12be3323b6 |
hex | a9e990000 |
45610500096 has 204 divisors, whose sum is σ = 150599530432. Its totient is φ = 13030391808.
The previous prime is 45610500079. The next prime is 45610500101. The reversal of 45610500096 is 69000501654.
45610500096 is a `hidden beast` number, since 4 + 5 + 61 + 0 + 500 + 0 + 96 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 45610500096.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4123245 + ... + 4134291.
Almost surely, 245610500096 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 45610500096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75299765216).
45610500096 is an abundant number, since it is smaller than the sum of its proper divisors (104989030336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45610500096 is an equidigital number, since it uses as much as digits as its factorization.
45610500096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11092 (or 11059 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 45610500096 in words is "forty-five billion, six hundred ten million, five hundred thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •