Base | Representation |
---|---|
bin | 1001110000001101… |
… | …11010110101010000 |
3 | 111111221000212101211 |
4 | 10320012322311100 |
5 | 41210443231412 |
6 | 2223332105504 |
7 | 243521601004 |
oct | 47006726520 |
9 | 14457025354 |
10 | 5236305232 |
11 | 2247837694 |
12 | 1021765294 |
13 | 655ab7a82 |
14 | 379614704 |
15 | 209a82ca7 |
hex | 1381bad50 |
5236305232 has 20 divisors (see below), whose sum is σ = 10472611456. Its totient is φ = 2533695840.
The previous prime is 5236305223. The next prime is 5236305241. The reversal of 5236305232 is 2325036325.
It is an interprime number because it is at equal distance from previous prime (5236305223) and next prime (5236305241).
5236305232 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 5236305194 and 5236305203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5278038 + ... + 5279029.
Almost surely, 25236305232 is an apocalyptic number.
It is an amenable number.
5236305232 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5236305232 is a wasteful number, since it uses less digits than its factorization.
5236305232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10557106 (or 10557100 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 31.
The square root of 5236305232 is about 72362.3191447040. The cubic root of 5236305232 is about 1736.5007881536.
The spelling of 5236305232 in words is "five billion, two hundred thirty-six million, three hundred five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •