Base | Representation |
---|---|
bin | 1001010100010111… |
… | …01001110100010000 |
3 | 110220122101201120111 |
4 | 10222023221310100 |
5 | 40221140241412 |
6 | 2144224251104 |
7 | 234653644555 |
oct | 45213516420 |
9 | 13818351514 |
10 | 5002665232 |
11 | 2137968484 |
12 | b77470a94 |
13 | 619582a56 |
14 | 356596a2c |
15 | 1e42d12a7 |
hex | 12a2e9d10 |
5002665232 has 40 divisors (see below), whose sum is σ = 10122816384. Its totient is φ = 2390513664.
The previous prime is 5002665223. The next prime is 5002665233. The reversal of 5002665232 is 2325662005.
It is a super-2 number, since 2×50026652322 = 50053318846923227648, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 5002665194 and 5002665203.
It is not an unprimeable number, because it can be changed into a prime (5002665233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 474288 + ... + 484720.
Almost surely, 25002665232 is an apocalyptic number.
It is an amenable number.
5002665232 is an abundant number, since it is smaller than the sum of its proper divisors (5120151152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5002665232 is a wasteful number, since it uses less digits than its factorization.
5002665232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11767 (or 11761 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
The square root of 5002665232 is about 70729.5216440773. The cubic root of 5002665232 is about 1710.2797248813.
The spelling of 5002665232 in words is "five billion, two million, six hundred sixty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •