Base | Representation |
---|---|
bin | 101101101101101000… |
… | …100110010011100100 |
3 | 11200200202012112002221 |
4 | 231231220212103210 |
5 | 1301011000440320 |
6 | 34314320242124 |
7 | 3355230053146 |
oct | 555550462344 |
9 | 150622175087 |
10 | 49083999460 |
11 | 198a8702311 |
12 | 961a170344 |
13 | 4823063482 |
14 | 2538c0ac96 |
15 | 14242573aa |
hex | b6da264e4 |
49083999460 has 48 divisors (see below), whose sum is σ = 105933063600. Its totient is φ = 19090183680.
The previous prime is 49083999457. The next prime is 49083999473. The reversal of 49083999460 is 6499938094.
49083999460 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 2178835684 + 46905163776 = 46678^2 + 216576^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1124850 + ... + 1167670.
It is an arithmetic number, because the mean of its divisors is an integer number (2206938825).
Almost surely, 249083999460 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 49083999460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52966531800).
49083999460 is an abundant number, since it is smaller than the sum of its proper divisors (56849064140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49083999460 is a wasteful number, since it uses less digits than its factorization.
49083999460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44416 (or 44414 counting only the distinct ones).
The product of its (nonzero) digits is 15116544, while the sum is 61.
The spelling of 49083999460 in words is "forty-nine billion, eighty-three million, nine hundred ninety-nine thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •