Base | Representation |
---|---|
bin | 111100010010100111001100… |
… | …0110011001000110110100001 |
3 | 2120112201110001000122001022022 |
4 | 1320211032120303020312201 |
5 | 1024002310314001303113 |
6 | 5115523153252351225 |
7 | 216463422302604635 |
oct | 17045163063106641 |
9 | 2515643030561268 |
10 | 530323650416033 |
11 | 143a82aa71727a1 |
12 | 4b590339615515 |
13 | 199bb3c868c146 |
14 | 94d5b31984dc5 |
15 | 4149e06321908 |
hex | 1e25398cc8da1 |
530323650416033 has 8 divisors (see below), whose sum is σ = 534139560323040. Its totient is φ = 526507749535680.
The previous prime is 530323650416009. The next prime is 530323650416059. The reversal of 530323650416033 is 330614056323035.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 530323650416033 - 28 = 530323650415777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530323650416083) 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 7 ways as a sum of consecutive naturals, for example, 154900898 + ... + 158287508.
It is an arithmetic number, because the mean of its divisors is an integer number (66767445040380).
Almost surely, 2530323650416033 is an apocalyptic number.
It is an amenable number.
530323650416033 is a deficient number, since it is larger than the sum of its proper divisors (3815909907007).
530323650416033 is a wasteful number, since it uses less digits than its factorization.
530323650416033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4513327.
The product of its (nonzero) digits is 1749600, while the sum is 44.
The spelling of 530323650416033 in words is "five hundred thirty trillion, three hundred twenty-three billion, six hundred fifty million, four hundred sixteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •