Base | Representation |
---|---|
bin | 101100101010100101… |
… | …000010101010110110 |
3 | 11120210100022022011212 |
4 | 230222211002222312 |
5 | 1241210000243330 |
6 | 34010531401422 |
7 | 3315316501514 |
oct | 545245025266 |
9 | 146710268155 |
10 | 47958993590 |
11 | 193806687a2 |
12 | 9365453272 |
13 | 46a3c68a21 |
14 | 246d63d4b4 |
15 | 13aa5d2295 |
hex | b2a942ab6 |
47958993590 has 32 divisors (see below), whose sum is σ = 91759941504. Its totient is φ = 17984880640.
The previous prime is 47958993587. The next prime is 47958993601. The reversal of 47958993590 is 9539985974.
It is a super-2 number, since 2×479589935902 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 47958993590.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 505166 + ... + 592545.
It is an arithmetic number, because the mean of its divisors is an integer number (2867498172).
Almost surely, 247958993590 is an apocalyptic number.
47958993590 is a deficient number, since it is larger than the sum of its proper divisors (43800947914).
47958993590 is a wasteful number, since it uses less digits than its factorization.
47958993590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1097992.
The product of its (nonzero) digits is 110224800, while the sum is 68.
The spelling of 47958993590 in words is "forty-seven billion, nine hundred fifty-eight million, nine hundred ninety-three thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •