Base | Representation |
---|---|
bin | 1001101111101111… |
… | …00001100101001000 |
3 | 111111122102211121110 |
4 | 10313313201211020 |
5 | 41203430112030 |
6 | 2223105410320 |
7 | 243442362303 |
oct | 46767414510 |
9 | 14448384543 |
10 | 5232269640 |
11 | 2245530694 |
12 | 10203399a0 |
13 | 655003c50 |
14 | 378c83b3a |
15 | 2095371b0 |
hex | 137de1948 |
5232269640 has 128 divisors (see below), whose sum is σ = 16923715200. Its totient is φ = 1286461440.
The previous prime is 5232269633. The next prime is 5232269663. The reversal of 5232269640 is 469622325.
It is a Harshad number since it is a multiple of its sum of digits (39).
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 31 ways as a sum of consecutive naturals, for example, 2059491 + ... + 2062029.
It is an arithmetic number, because the mean of its divisors is an integer number (132216525).
Almost surely, 25232269640 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5232269640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8461857600).
5232269640 is an abundant number, since it is smaller than the sum of its proper divisors (11691445560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5232269640 is a wasteful number, since it uses less digits than its factorization.
5232269640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3887 (or 3883 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 39.
The square root of 5232269640 is about 72334.4291468454. The cubic root of 5232269640 is about 1736.0545695929.
The spelling of 5232269640 in words is "five billion, two hundred thirty-two million, two hundred sixty-nine thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •