Base | Representation |
---|---|
bin | 101010110011010100… |
… | …101001110111101000 |
3 | 11101121220110220200220 |
4 | 222303110221313220 |
5 | 1223110300142000 |
6 | 33040215530040 |
7 | 3214613221344 |
oct | 526324516750 |
9 | 141556426626 |
10 | 45958209000 |
11 | 18544235710 |
12 | 8aa7389920 |
13 | 44455a8512 |
14 | 231da1c624 |
15 | 12deb171a0 |
hex | ab3529de8 |
45958209000 has 512 divisors, whose sum is σ = 164716830720. Its totient is φ = 10560000000.
The previous prime is 45958208981. The next prime is 45958209029. The reversal of 45958209000 is 90285954.
It is a super-2 number, since 2×459582090002 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 114608800 + ... + 114609200.
It is an arithmetic number, because the mean of its divisors is an integer number (321712560).
Almost surely, 245958209000 is an apocalyptic number.
45958209000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45958209000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82358415360).
45958209000 is an abundant number, since it is smaller than the sum of its proper divisors (118758621720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45958209000 is a wasteful number, since it uses less digits than its factorization.
45958209000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610 (or 596 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 42.
The spelling of 45958209000 in words is "forty-five billion, nine hundred fifty-eight million, two hundred nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •