Base | Representation |
---|---|
bin | 1000101011100100… |
… | …01001000011011000 |
3 | 110000210102112100210 |
4 | 10111302021003120 |
5 | 34021032324422 |
6 | 2050241131120 |
7 | 223330012356 |
oct | 42562110330 |
9 | 13023375323 |
10 | 4660433112 |
11 | 1a81769415 |
12 | aa0929aa0 |
13 | 5936b943a |
14 | 322d4c7d6 |
15 | 1c422e10c |
hex | 115c890d8 |
4660433112 has 32 divisors (see below), whose sum is σ = 12026926080. Its totient is φ = 1503365280.
The previous prime is 4660433111. The next prime is 4660433119. The reversal of 4660433112 is 2113340664.
It is a self number, because there is not a number n which added to its sum of digits gives 4660433112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4660433111) 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 7 ways as a sum of consecutive naturals, for example, 3131268 + ... + 3132755.
It is an arithmetic number, because the mean of its divisors is an integer number (375841440).
Almost surely, 24660433112 is an apocalyptic number.
It is an amenable number.
4660433112 is an abundant number, since it is smaller than the sum of its proper divisors (7366492968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4660433112 is a wasteful number, since it uses less digits than its factorization.
4660433112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6264063 (or 6264059 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
The square root of 4660433112 is about 68267.3649117937. The cubic root of 4660433112 is about 1670.3549166179.
Adding to 4660433112 its reverse (2113340664), we get a palindrome (6773773776).
The spelling of 4660433112 in words is "four billion, six hundred sixty million, four hundred thirty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •