Base | Representation |
---|---|
bin | 1010110111111110… |
… | …00101001111100000 |
3 | 120001212122211122010 |
4 | 11123333011033200 |
5 | 43424041333441 |
6 | 2403153312520 |
7 | 264451066110 |
oct | 53377051740 |
9 | 16055584563 |
10 | 5838230496 |
11 | 252658aa8a |
12 | 116b265740 |
13 | 720708a77 |
14 | 3d553d040 |
15 | 242831116 |
hex | 15bfc53e0 |
5838230496 has 96 divisors (see below), whose sum is σ = 18079746048. Its totient is φ = 1614251520.
The previous prime is 5838230473. The next prime is 5838230521. The reversal of 5838230496 is 6940328385.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 119295 + ... + 160958.
It is an arithmetic number, because the mean of its divisors is an integer number (188330688).
Almost surely, 25838230496 is an apocalyptic number.
5838230496 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
5838230496 is an abundant number, since it is smaller than the sum of its proper divisors (12241515552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5838230496 is a wasteful number, since it uses less digits than its factorization.
5838230496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280304 (or 280296 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 48.
The square root of 5838230496 is about 76408.3143119909. The cubic root of 5838230496 is about 1800.6407694008.
The spelling of 5838230496 in words is "five billion, eight hundred thirty-eight million, two hundred thirty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •