Base | Representation |
---|---|
bin | 1010100010001001… |
… | …01011010000010000 |
3 | 112121010011021000202 |
4 | 11101010223100100 |
5 | 43040204210121 |
6 | 2333053234332 |
7 | 260065650413 |
oct | 52104532020 |
9 | 15533137022 |
10 | 5655147536 |
11 | 2442202055 |
12 | 1119a929a8 |
13 | 6c17c585c |
14 | 3b90c1b7a |
15 | 23171940b |
hex | 15112b410 |
5655147536 has 80 divisors (see below), whose sum is σ = 11858645760. Its totient is φ = 2604026880.
The previous prime is 5655147527. The next prime is 5655147559. The reversal of 5655147536 is 6357415565.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2241956 + ... + 2244476.
It is an arithmetic number, because the mean of its divisors is an integer number (148233072).
Almost surely, 25655147536 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 5655147536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5929322880).
5655147536 is an abundant number, since it is smaller than the sum of its proper divisors (6203498224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5655147536 is a wasteful number, since it uses less digits than its factorization.
5655147536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2752 (or 2746 counting only the distinct ones).
The product of its digits is 1890000, while the sum is 47.
The square root of 5655147536 is about 75200.7149966009. The cubic root of 5655147536 is about 1781.6182245684.
The spelling of 5655147536 in words is "five billion, six hundred fifty-five million, one hundred forty-seven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •