Base | Representation |
---|---|
bin | 1010111010000000… |
… | …01100011110001000 |
3 | 120010001210000212010 |
4 | 11131000030132020 |
5 | 43442424040324 |
6 | 2405003215520 |
7 | 265046136630 |
oct | 53500143610 |
9 | 16101700763 |
10 | 5855299464 |
11 | 2535189173 |
12 | 1174b175a0 |
13 | 724104051 |
14 | 3d79036c0 |
15 | 2440a3829 |
hex | 15d00c788 |
5855299464 has 128 divisors (see below), whose sum is σ = 17792409600. Its totient is φ = 1568471040.
The previous prime is 5855299447. The next prime is 5855299493. The reversal of 5855299464 is 4649925585.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 300169 + ... + 319079.
It is an arithmetic number, because the mean of its divisors is an integer number (139003200).
Almost surely, 25855299464 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 5855299464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8896204800).
5855299464 is an abundant number, since it is smaller than the sum of its proper divisors (11937110136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5855299464 is a wasteful number, since it uses less digits than its factorization.
5855299464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19043 (or 19039 counting only the distinct ones).
The product of its digits is 15552000, while the sum is 57.
The square root of 5855299464 is about 76519.9285415244. The cubic root of 5855299464 is about 1802.3938790878.
The spelling of 5855299464 in words is "five billion, eight hundred fifty-five million, two hundred ninety-nine thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •