Base | Representation |
---|---|
bin | 111001011101011111011000… |
… | …0001100001100001000100111 |
3 | 2110021120200020110120201100002 |
4 | 1302322332300030030020213 |
5 | 1012221432441034131211 |
6 | 4550543305342011515 |
7 | 211314066536023433 |
oct | 16272766014141047 |
9 | 2407520213521302 |
10 | 505430412411431 |
11 | 13705591a298551 |
12 | 4882b972576b9b |
13 | 18903b63a26cc0 |
14 | 8cb4d690c59c3 |
15 | 3d6761195803b |
hex | 1cbafb030c227 |
505430412411431 has 16 divisors (see below), whose sum is σ = 563192706471360. Its totient is φ = 450372193286400.
The previous prime is 505430412411403. The next prime is 505430412411437. The reversal of 505430412411431 is 134114214034505.
It is a cyclic number.
It is not a de Polignac number, because 505430412411431 - 214 = 505430412395047 is a prime.
It is a super-2 number, since 2×5054304124114312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505430412411437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 133526750 + ... + 137259803.
It is an arithmetic number, because the mean of its divisors is an integer number (35199544154460).
Almost surely, 2505430412411431 is an apocalyptic number.
505430412411431 is a deficient number, since it is larger than the sum of its proper divisors (57762294059929).
505430412411431 is a wasteful number, since it uses less digits than its factorization.
505430412411431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270791546.
The product of its (nonzero) digits is 115200, while the sum is 38.
Adding to 505430412411431 its reverse (134114214034505), we get a palindrome (639544626445936).
The spelling of 505430412411431 in words is "five hundred five trillion, four hundred thirty billion, four hundred twelve million, four hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •