Base | Representation |
---|---|
bin | 111100010000011110100011… |
… | …0001111001100101011000010 |
3 | 2120111200101121110222201110210 |
4 | 1320200331012033030223002 |
5 | 1023433003331104033113 |
6 | 5115140303232134550 |
7 | 216433263435061254 |
oct | 17040750617145302 |
9 | 2514611543881423 |
10 | 530030207486658 |
11 | 14397a6042a372a |
12 | 4b5434a4097456 |
13 | 19999832173ba8 |
14 | 94c5855621cd4 |
15 | 414247e6386c3 |
hex | 1e20f463ccac2 |
530030207486658 has 8 divisors (see below), whose sum is σ = 1060060414973328. Its totient is φ = 176676735828884.
The previous prime is 530030207486641. The next prime is 530030207486699. The reversal of 530030207486658 is 856684702030035.
It is a sphenic number, since it is the product of 3 distinct primes.
530030207486658 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 530030207486598 and 530030207486607.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 44169183957216 + ... + 44169183957227.
It is an arithmetic number, because the mean of its divisors is an integer number (132507551871666).
Almost surely, 2530030207486658 is an apocalyptic number.
530030207486658 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530030207486658 is a wasteful number, since it uses less digits than its factorization.
530030207486658 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88338367914448.
The product of its (nonzero) digits is 29030400, while the sum is 57.
The spelling of 530030207486658 in words is "five hundred thirty trillion, thirty billion, two hundred seven million, four hundred eighty-six thousand, six hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •