Base | Representation |
---|---|
bin | 11110101100000001001… |
… | …10010101011010010111 |
3 | 10201210122122202111222201 |
4 | 33112000212111122113 |
5 | 114233430134122333 |
6 | 2124221304505331 |
7 | 136115423354005 |
oct | 17260046253227 |
9 | 3653578674881 |
10 | 1054424520343 |
11 | 3771a7175627 |
12 | 15043077b247 |
13 | 7857c8a532c |
14 | 3906a635a75 |
15 | 1c66478a17d |
hex | f580995697 |
1054424520343 has 2 divisors, whose sum is σ = 1054424520344. Its totient is φ = 1054424520342.
The previous prime is 1054424520341. The next prime is 1054424520427. The reversal of 1054424520343 is 3430254244501.
1054424520343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1054424520343 - 21 = 1054424520341 is a prime.
It is a super-2 number, since 2×10544245203432 (a number of 25 digits) contains 22 as substring.
Together with 1054424520341, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054424520341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527212260171 + 527212260172.
It is an arithmetic number, because the mean of its divisors is an integer number (527212260172).
Almost surely, 21054424520343 is an apocalyptic number.
1054424520343 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054424520343 is an equidigital number, since it uses as much as digits as its factorization.
1054424520343 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 230400, while the sum is 37.
Adding to 1054424520343 its reverse (3430254244501), we get a palindrome (4484678764844).
The spelling of 1054424520343 in words is "one trillion, fifty-four billion, four hundred twenty-four million, five hundred twenty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •