Base | Representation |
---|---|
bin | 1010100001000011… |
… | …10101101000001100 |
3 | 112120110222021112020 |
4 | 11100201311220030 |
5 | 43030334434423 |
6 | 2332125410140 |
7 | 256625223045 |
oct | 52041655014 |
9 | 15513867466 |
10 | 5646014988 |
11 | 2438034699 |
12 | 1116a09950 |
13 | 6bc948a93 |
14 | 3b7bc58cc |
15 | 230a134e3 |
hex | 150875a0c |
5646014988 has 48 divisors (see below), whose sum is σ = 13642819680. Its totient is φ = 1815174144.
The previous prime is 5646014987. The next prime is 5646015031. The reversal of 5646014988 is 8894106465.
It is a self number, because there is not a number n which added to its sum of digits gives 5646014988.
It is not an unprimeable number, because it can be changed into a prime (5646014987) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 338820 + ... + 355092.
It is an arithmetic number, because the mean of its divisors is an integer number (284225410).
Almost surely, 25646014988 is an apocalyptic number.
5646014988 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
5646014988 is an abundant number, since it is smaller than the sum of its proper divisors (7996804692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5646014988 is a wasteful number, since it uses less digits than its factorization.
5646014988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17306 (or 17304 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 51.
The square root of 5646014988 is about 75139.9693106139. The cubic root of 5646014988 is about 1780.6586574784.
The spelling of 5646014988 in words is "five billion, six hundred forty-six million, fourteen thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •