Base | Representation |
---|---|
bin | 11101100101000100110… |
… | …11010100011010110001 |
3 | 10121011100022000220201211 |
4 | 32302202123110122301 |
5 | 113122424330233434 |
6 | 2054522100400121 |
7 | 133266533645653 |
oct | 16624233243261 |
9 | 3534308026654 |
10 | 1016337352369 |
11 | 362031a375a9 |
12 | 144b813a6041 |
13 | 74abcbca251 |
14 | 372961126d3 |
15 | 1b685b98464 |
hex | eca26d46b1 |
1016337352369 has 2 divisors, whose sum is σ = 1016337352370. Its totient is φ = 1016337352368.
The previous prime is 1016337352339. The next prime is 1016337352379. The reversal of 1016337352369 is 9632537336101.
1016337352369 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 can be written as a sum of positive squares in only one way, i.e., 726096564769 + 290240787600 = 852113^2 + 538740^2 .
It is a cyclic number.
It is not a de Polignac number, because 1016337352369 - 29 = 1016337351857 is a prime.
It is a super-2 number, since 2×10163373523692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1016337352319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 508168676184 + 508168676185.
It is an arithmetic number, because the mean of its divisors is an integer number (508168676185).
Almost surely, 21016337352369 is an apocalyptic number.
It is an amenable number.
1016337352369 is a deficient number, since it is larger than the sum of its proper divisors (1).
1016337352369 is an equidigital number, since it uses as much as digits as its factorization.
1016337352369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1837080, while the sum is 49.
The spelling of 1016337352369 in words is "one trillion, sixteen billion, three hundred thirty-seven million, three hundred fifty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •