Base | Representation |
---|---|
bin | 1001011010110100110011… |
… | …0010110111011001111001 |
3 | 1100200001211010100201122121 |
4 | 2112231030302313121321 |
5 | 2324140004331200314 |
6 | 34005404535121241 |
7 | 2116141412143042 |
oct | 226551462673171 |
9 | 40601733321577 |
10 | 10356454553209 |
11 | 333316966a766 |
12 | 11b3197813221 |
13 | 5a17c0024bab |
14 | 27b37dcd58c9 |
15 | 12e5dd96bd24 |
hex | 96b4ccb7679 |
10356454553209 has 2 divisors, whose sum is σ = 10356454553210. Its totient is φ = 10356454553208.
The previous prime is 10356454553183. The next prime is 10356454553233. The reversal of 10356454553209 is 90235545465301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7848665593209 + 2507788960000 = 2801547^2 + 1583600^2 .
It is an emirp because it is prime and its reverse (90235545465301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10356454553209 is a prime.
It is a super-3 number, since 3×103564545532093 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10356454553299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5178227276604 + 5178227276605.
It is an arithmetic number, because the mean of its divisors is an integer number (5178227276605).
Almost surely, 210356454553209 is an apocalyptic number.
It is an amenable number.
10356454553209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10356454553209 is an equidigital number, since it uses as much as digits as its factorization.
10356454553209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720000, while the sum is 52.
The spelling of 10356454553209 in words is "ten trillion, three hundred fifty-six billion, four hundred fifty-four million, five hundred fifty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •