Base | Representation |
---|---|
bin | 1001101111100001… |
… | …00001010011100000 |
3 | 111111111222112220102 |
4 | 10313300201103200 |
5 | 41202442333004 |
6 | 2223002201532 |
7 | 243420644162 |
oct | 46760412340 |
9 | 14444875812 |
10 | 5230433504 |
11 | 224449711a |
12 | 101b7b32a8 |
13 | 65481028a |
14 | 378926932 |
15 | 2092c311e |
hex | 137c214e0 |
5230433504 has 48 divisors (see below), whose sum is σ = 10665723600. Its totient is φ = 2521903104.
The previous prime is 5230433497. The next prime is 5230433513. The reversal of 5230433504 is 4053340325.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 859079 + ... + 865145.
It is an arithmetic number, because the mean of its divisors is an integer number (222202575).
Almost surely, 25230433504 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 5230433504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5332861800).
5230433504 is an abundant number, since it is smaller than the sum of its proper divisors (5435290096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5230433504 is a wasteful number, since it uses less digits than its factorization.
5230433504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7035 (or 7027 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 29.
The square root of 5230433504 is about 72321.7360411101. The cubic root of 5230433504 is about 1735.8514706537.
Adding to 5230433504 its reverse (4053340325), we get a palindrome (9283773829).
The spelling of 5230433504 in words is "five billion, two hundred thirty million, four hundred thirty-three thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •