Base | Representation |
---|---|
bin | 101010011000000111… |
… | …010100111011100010 |
3 | 11100110002112101221220 |
4 | 222120013110323202 |
5 | 1221141420334110 |
6 | 32523031555510 |
7 | 3200401220334 |
oct | 523007247342 |
9 | 140402471856 |
10 | 45501730530 |
11 | 1832a5a4683 |
12 | 899a52bb96 |
13 | 43a1b50b09 |
14 | 22b9155454 |
15 | 12b49e9370 |
hex | a981d4ee2 |
45501730530 has 64 divisors (see below), whose sum is σ = 114210155520. Its totient is φ = 11579961536.
The previous prime is 45501730487. The next prime is 45501730531. The reversal of 45501730530 is 3503710554.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 45501730491 and 45501730500.
It is not an unprimeable number, because it can be changed into a prime (45501730531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 231241 + ... + 380099.
It is an arithmetic number, because the mean of its divisors is an integer number (1784533680).
Almost surely, 245501730530 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45501730530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57105077760).
45501730530 is an abundant number, since it is smaller than the sum of its proper divisors (68708424990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45501730530 is a wasteful number, since it uses less digits than its factorization.
45501730530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149335.
The product of its (nonzero) digits is 31500, while the sum is 33.
The spelling of 45501730530 in words is "forty-five billion, five hundred one million, seven hundred thirty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •