Base | Representation |
---|---|
bin | 11110101101001000011… |
… | …01100101010000100111 |
3 | 10201212012022001012200021 |
4 | 33112210031211100213 |
5 | 114241141113331211 |
6 | 2124400451100011 |
7 | 136136300063353 |
oct | 17264415452047 |
9 | 3655168035607 |
10 | 1055022011431 |
11 | 37748346a513 |
12 | 1505788a1607 |
13 | 78646602c5b |
14 | 390c5b28463 |
15 | 1c69be5e771 |
hex | f5a4365427 |
1055022011431 has 2 divisors, whose sum is σ = 1055022011432. Its totient is φ = 1055022011430.
The previous prime is 1055022011383. The next prime is 1055022011473. The reversal of 1055022011431 is 1341102205501.
1055022011431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1055022011431 - 29 = 1055022010919 is a prime.
It is a super-2 number, since 2×10550220114312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055022011396 and 1055022011405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055022018431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527511005715 + 527511005716.
It is an arithmetic number, because the mean of its divisors is an integer number (527511005716).
Almost surely, 21055022011431 is an apocalyptic number.
1055022011431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055022011431 is an equidigital number, since it uses as much as digits as its factorization.
1055022011431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 1055022011431 its reverse (1341102205501), we get a palindrome (2396124216932).
The spelling of 1055022011431 in words is "one trillion, fifty-five billion, twenty-two million, eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •