Base | Representation |
---|---|
bin | 101010011010011011… |
… | …100110100011011110 |
3 | 11100112210200011220000 |
4 | 222122123212203132 |
5 | 1221231343200110 |
6 | 32530541035130 |
7 | 3201352466442 |
oct | 523233464336 |
9 | 140483604800 |
10 | 45540600030 |
11 | 1834a532932 |
12 | 89ab555aa6 |
13 | 43a9c0cc13 |
14 | 22c0392822 |
15 | 12b81261c0 |
hex | a9a6e68de |
45540600030 has 160 divisors (see below), whose sum is σ = 124825013280. Its totient is φ = 11911276800.
The previous prime is 45540600013. The next prime is 45540600041. The reversal of 45540600030 is 3000604554.
45540600030 is a `hidden beast` number, since 4 + 5 + 54 + 0 + 600 + 0 + 3 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 45540599967 and 45540600003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 8914737 + ... + 8919843.
It is an arithmetic number, because the mean of its divisors is an integer number (780156333).
Almost surely, 245540600030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45540600030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62412506640).
45540600030 is an abundant number, since it is smaller than the sum of its proper divisors (79284413250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45540600030 is a wasteful number, since it uses less digits than its factorization.
45540600030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5336 (or 5327 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The spelling of 45540600030 in words is "forty-five billion, five hundred forty million, six hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •