Base | Representation |
---|---|
bin | 1001010101011111… |
… | …01101011000101000 |
3 | 110221022011221000011 |
4 | 10222233231120220 |
5 | 40231100221112 |
6 | 2145203021304 |
7 | 235130202046 |
oct | 45257553050 |
9 | 13838157004 |
10 | 5012117032 |
11 | 214223378a |
12 | b7a66a834 |
13 | 61b511c30 |
14 | 357937396 |
15 | 1e504baa7 |
hex | 12abed628 |
5012117032 has 32 divisors (see below), whose sum is σ = 10124147880. Its totient is φ = 2312478720.
The previous prime is 5012116979. The next prime is 5012117069. The reversal of 5012117032 is 2307112105.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1231588836 + 3780528196 = 35094^2 + 61486^2 .
It is a junction number, because it is equal to n+sod(n) for n = 5012116994 and 5012117012.
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 7 ways as a sum of consecutive naturals, for example, 375432 + ... + 388552.
Almost surely, 25012117032 is an apocalyptic number.
5012117032 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5012117032 is an abundant number, since it is smaller than the sum of its proper divisors (5112030848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5012117032 is a wasteful number, since it uses less digits than its factorization.
5012117032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16813 (or 16809 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 22.
The square root of 5012117032 is about 70796.3066268291. The cubic root of 5012117032 is about 1711.3561545592.
Adding to 5012117032 its reverse (2307112105), we get a palindrome (7319229137).
The spelling of 5012117032 in words is "five billion, twelve million, one hundred seventeen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •