Base | Representation |
---|---|
bin | 1111011011110111000… |
… | …10001010010101110111 |
3 | 1212200221020201210220220 |
4 | 13231323202022111313 |
5 | 32142131000431411 |
6 | 1043350244425423 |
7 | 53213440424520 |
oct | 7557342122567 |
9 | 1780836653826 |
10 | 530353530231 |
11 | 194a15817a78 |
12 | 869523a8273 |
13 | 3b020833b55 |
14 | 1b9525b7847 |
15 | dbe07e1b06 |
hex | 7b7b88a577 |
530353530231 has 8 divisors (see below), whose sum is σ = 808157760384. Its totient is φ = 303059160120.
The previous prime is 530353530221. The next prime is 530353530233. The reversal of 530353530231 is 132035353035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 530353530231 - 215 = 530353497463 is a prime.
It is a super-2 number, since 2×5303535302312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530353530192 and 530353530201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530353530233) 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, 12627464985 + ... + 12627465026.
It is an arithmetic number, because the mean of its divisors is an integer number (101019720048).
Almost surely, 2530353530231 is an apocalyptic number.
530353530231 is a deficient number, since it is larger than the sum of its proper divisors (277804230153).
530353530231 is a wasteful number, since it uses less digits than its factorization.
530353530231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25254930021.
The product of its (nonzero) digits is 60750, while the sum is 33.
Adding to 530353530231 its reverse (132035353035), we get a palindrome (662388883266).
The spelling of 530353530231 in words is "five hundred thirty billion, three hundred fifty-three million, five hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •