Base | Representation |
---|---|
bin | 11101101100001000010… |
… | …00101101010100001111 |
3 | 10121112010012111212102221 |
4 | 32312010020231110033 |
5 | 113203203233440211 |
6 | 2100345532200211 |
7 | 133462424662516 |
oct | 16660410552417 |
9 | 3545105455387 |
10 | 1020124124431 |
11 | 3636a5523495 |
12 | 145859609067 |
13 | 752745b2789 |
14 | 37534ddd67d |
15 | 1b80834ec71 |
hex | ed8422d50f |
1020124124431 has 2 divisors, whose sum is σ = 1020124124432. Its totient is φ = 1020124124430.
The previous prime is 1020124124419. The next prime is 1020124124501. The reversal of 1020124124431 is 1344214210201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1020124124431 - 227 = 1019989906703 is a prime.
It is a super-2 number, since 2×10201241244312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020124124396 and 1020124124405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020124125431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510062062215 + 510062062216.
It is an arithmetic number, because the mean of its divisors is an integer number (510062062216).
Almost surely, 21020124124431 is an apocalyptic number.
1020124124431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020124124431 is an equidigital number, since it uses as much as digits as its factorization.
1020124124431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 1020124124431 its reverse (1344214210201), we get a palindrome (2364338334632).
The spelling of 1020124124431 in words is "one trillion, twenty billion, one hundred twenty-four million, one hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •