Base | Representation |
---|---|
bin | 1111011011101010111… |
… | …00000000010110011110 |
3 | 1212200200010021121010212 |
4 | 13231311130000112132 |
5 | 32141423310100100 |
6 | 1043332152332422 |
7 | 53211056166563 |
oct | 7556534002636 |
9 | 1780603247125 |
10 | 530251253150 |
11 | 194973010763 |
12 | 869240a4112 |
13 | 3b0055a3a78 |
14 | 1b942b9286a |
15 | dbd683c635 |
hex | 7b7570059e |
530251253150 has 48 divisors (see below), whose sum is σ = 1013042869440. Its totient is φ = 206343676800.
The previous prime is 530251253149. The next prime is 530251253197. The reversal of 530251253150 is 51352152035.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31217660 + ... + 31234640.
It is an arithmetic number, because the mean of its divisors is an integer number (21105059780).
Almost surely, 2530251253150 is an apocalyptic number.
530251253150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
530251253150 is a deficient number, since it is larger than the sum of its proper divisors (482791616290).
530251253150 is a wasteful number, since it uses less digits than its factorization.
530251253150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33909 (or 33904 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 32.
The spelling of 530251253150 in words is "five hundred thirty billion, two hundred fifty-one million, two hundred fifty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •