Base | Representation |
---|---|
bin | 1000101011111001… |
… | …01101100011011000 |
3 | 110000222122022101100 |
4 | 10111330231203120 |
5 | 34022240012211 |
6 | 2050420351400 |
7 | 223362403050 |
oct | 42574554330 |
9 | 13028568340 |
10 | 4663204056 |
11 | 1a83291255 |
12 | aa1845560 |
13 | 594149754 |
14 | 323470560 |
15 | 1c45ca156 |
hex | 115f2d8d8 |
4663204056 has 48 divisors (see below), whose sum is σ = 14433728400. Its totient is φ = 1332343872.
The previous prime is 4663204043. The next prime is 4663204127. The reversal of 4663204056 is 6504023664.
It is a super-2 number, since 2×46632040562 = 43490944135789702272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 4663204056.
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 11 ways as a sum of consecutive naturals, for example, 4625691 + ... + 4626698.
It is an arithmetic number, because the mean of its divisors is an integer number (300702675).
Almost surely, 24663204056 is an apocalyptic number.
It is an amenable number.
4663204056 is an abundant number, since it is smaller than the sum of its proper divisors (9770524344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4663204056 is a wasteful number, since it uses less digits than its factorization.
4663204056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9252408 (or 9252401 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
The square root of 4663204056 is about 68287.6566884529. The cubic root of 4663204056 is about 1670.6858975099.
The spelling of 4663204056 in words is "four billion, six hundred sixty-three million, two hundred four thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •