Base | Representation |
---|---|
bin | 1111010110010110… |
… | …0001000010001000 |
3 | 101122010222111221101 |
4 | 3311211201002020 |
5 | 31414241040202 |
6 | 1520503151144 |
7 | 204050366053 |
oct | 36545410210 |
9 | 11563874841 |
10 | 4120252552 |
11 | 18248587a9 |
12 | 96ba454b4 |
13 | 508806580 |
14 | 2b12d7a9a |
15 | 191aca887 |
hex | f5961088 |
4120252552 has 16 divisors (see below), whose sum is σ = 8319740940. Its totient is φ = 1901654976.
The previous prime is 4120252547. The next prime is 4120252553. The reversal of 4120252552 is 2552520214.
It can be written as a sum of positive squares in 2 ways, for example, as 3589687396 + 530565156 = 59914^2 + 23034^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 4120252552.
It is not an unprimeable number, because it can be changed into a prime (4120252553) 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 3 ways as a sum of consecutive naturals, for example, 19808803 + ... + 19809010.
Almost surely, 24120252552 is an apocalyptic number.
It is an amenable number.
4120252552 is an abundant number, since it is smaller than the sum of its proper divisors (4199488388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4120252552 is a wasteful number, since it uses less digits than its factorization.
4120252552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39617832 (or 39617828 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 4120252552 is about 64189.1934206997. The cubic root of 4120252552 is about 1603.1516721504.
Adding to 4120252552 its reverse (2552520214), we get a palindrome (6672772766).
The spelling of 4120252552 in words is "four billion, one hundred twenty million, two hundred fifty-two thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •