Base | Representation |
---|---|
bin | 1000000011010110… |
… | …01000101001111000 |
3 | 102011021120210200200 |
4 | 10001223020221320 |
5 | 32323200132102 |
6 | 1552550002200 |
7 | 212062223406 |
oct | 40153105170 |
9 | 12137523620 |
10 | 4323052152 |
11 | 1919283081 |
12 | a07946360 |
13 | 53b830c33 |
14 | 2d0208476 |
15 | 1a47d951c |
hex | 101ac8a78 |
4323052152 has 48 divisors (see below), whose sum is σ = 11740950000. Its totient is φ = 1436994816.
The previous prime is 4323052117. The next prime is 4323052211. The reversal of 4323052152 is 2512503234.
It is a happy number.
4323052152 is a `hidden beast` number, since 432 + 30 + 52 + 152 = 666.
It is a super-2 number, since 2×43230521522 = 37377559817823662208, which contains 22 as substring.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 57777 + ... + 109472.
It is an arithmetic number, because the mean of its divisors is an integer number (244603125).
Almost surely, 24323052152 is an apocalyptic number.
It is an amenable number.
4323052152 is an abundant number, since it is smaller than the sum of its proper divisors (7417897848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4323052152 is a wasteful number, since it uses less digits than its factorization.
4323052152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167620 (or 167613 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 4323052152 is about 65749.9213079377. The cubic root of 4323052152 is about 1629.0340359200.
Adding to 4323052152 its reverse (2512503234), we get a palindrome (6835555386).
The spelling of 4323052152 in words is "four billion, three hundred twenty-three million, fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •