Base | Representation |
---|---|
bin | 11110101010100001101… |
… | …11000110111110110111 |
3 | 10201201120211201010100112 |
4 | 33111100313012332313 |
5 | 114230310121030234 |
6 | 2124010014333235 |
7 | 136056526633166 |
oct | 17252067067667 |
9 | 3651524633315 |
10 | 1053623611319 |
11 | 376926073844 |
12 | 1502484ba21b |
13 | 78482994776 |
14 | 38dd21113dd |
15 | 1c6192d3ace |
hex | f550dc6fb7 |
1053623611319 has 2 divisors, whose sum is σ = 1053623611320. Its totient is φ = 1053623611318.
The previous prime is 1053623611309. The next prime is 1053623611351. The reversal of 1053623611319 is 9131163263501.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1053623611319 is a prime.
It is a super-2 number, since 2×10536236113192 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053623611309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526811805659 + 526811805660.
It is an arithmetic number, because the mean of its divisors is an integer number (526811805660).
Almost surely, 21053623611319 is an apocalyptic number.
1053623611319 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053623611319 is an equidigital number, since it uses as much as digits as its factorization.
1053623611319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 41.
The spelling of 1053623611319 in words is "one trillion, fifty-three billion, six hundred twenty-three million, six hundred eleven thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •