Base | Representation |
---|---|
bin | 1111011011111101001… |
… | …10101010100011111111 |
3 | 1212201001211122220101011 |
4 | 13231332212222203333 |
5 | 32142232142324211 |
6 | 1043355324500051 |
7 | 53214634321045 |
oct | 7557646524377 |
9 | 1781054586334 |
10 | 530405042431 |
11 | 194a41900940 |
12 | 869676aa627 |
13 | 3b02b3cb644 |
14 | 1b959386395 |
15 | dbe50b9921 |
hex | 7b7e9aa8ff |
530405042431 has 8 divisors (see below), whose sum is σ = 578693977344. Its totient is φ = 482127823320.
The previous prime is 530405042417. The next prime is 530405042467. The reversal of 530405042431 is 134240504035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 530405042431 - 25 = 530405042399 is a prime.
It is a super-2 number, since 2×5304050424312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530405042393 and 530405042402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530405042471) 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, 2834151 + ... + 3015496.
It is an arithmetic number, because the mean of its divisors is an integer number (72336747168).
Almost surely, 2530405042431 is an apocalyptic number.
530405042431 is a deficient number, since it is larger than the sum of its proper divisors (48288934913).
530405042431 is a wasteful number, since it uses less digits than its factorization.
530405042431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5857901.
The product of its (nonzero) digits is 28800, while the sum is 31.
Adding to 530405042431 its reverse (134240504035), we get a palindrome (664645546466).
The spelling of 530405042431 in words is "five hundred thirty billion, four hundred five million, forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •