Base | Representation |
---|---|
bin | 1111011011100110101… |
… | …11110011111101001000 |
3 | 1212200120201002000002110 |
4 | 13231303113303331020 |
5 | 32141340422134433 |
6 | 1043324513502320 |
7 | 53210155506261 |
oct | 7556327637510 |
9 | 1780521060073 |
10 | 530216599368 |
11 | 1949554a1875 |
12 | 869145719a0 |
13 | 3accb35c781 |
14 | 1b93c331968 |
15 | dbd3794963 |
hex | 7b735f3f48 |
530216599368 has 32 divisors (see below), whose sum is σ = 1325593445760. Its totient is φ = 176731940160.
The previous prime is 530216599361. The next prime is 530216599379. The reversal of 530216599368 is 863995612035.
It is a super-2 number, since 2×5302165993682 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (530216599361) 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, 211873 + ... + 1051343.
It is an arithmetic number, because the mean of its divisors is an integer number (41424795180).
Almost surely, 2530216599368 is an apocalyptic number.
It is an amenable number.
530216599368 is an abundant number, since it is smaller than the sum of its proper divisors (795376846392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530216599368 is a wasteful number, since it uses less digits than its factorization.
530216599368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 865797 (or 865793 counting only the distinct ones).
The product of its (nonzero) digits is 10497600, while the sum is 57.
The spelling of 530216599368 in words is "five hundred thirty billion, two hundred sixteen million, five hundred ninety-nine thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •