Base | Representation |
---|---|
bin | 111100010000010001000111… |
… | …1100010101100011100111001 |
3 | 2120111120122011220222211201211 |
4 | 1320200202033202230130321 |
5 | 1023432020302334011012 |
6 | 5115115134055443121 |
7 | 216431223043215220 |
oct | 17040421742543471 |
9 | 2514518156884654 |
10 | 530001372563257 |
11 | 143969357782a21 |
12 | 4b5399973864a1 |
13 | 19996bb829633a |
14 | 94c42bbc15cb7 |
15 | 4141842e4c6a7 |
hex | 1e2088f8ac739 |
530001372563257 has 16 divisors (see below), whose sum is σ = 626612134896000. Its totient is φ = 438615156712320.
The previous prime is 530001372563237. The next prime is 530001372563269. The reversal of 530001372563257 is 752365273100035.
It is not a de Polignac number, because 530001372563257 - 211 = 530001372561209 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 530001372563257.
It is not an unprimeable number, because it can be changed into a prime (530001372563237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6441007 + ... + 33188692.
It is an arithmetic number, because the mean of its divisors is an integer number (39163258431000).
Almost surely, 2530001372563257 is an apocalyptic number.
It is an amenable number.
530001372563257 is a deficient number, since it is larger than the sum of its proper divisors (96610762332743).
530001372563257 is a wasteful number, since it uses less digits than its factorization.
530001372563257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39695616.
The product of its (nonzero) digits is 3969000, while the sum is 49.
The spelling of 530001372563257 in words is "five hundred thirty trillion, one billion, three hundred seventy-two million, five hundred sixty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •