Base | Representation |
---|---|
bin | 1100000111011000001110… |
… | …0100001111000011110111 |
3 | 1202011110120111011020110022 |
4 | 3001312003210033003313 |
5 | 3221222201112232223 |
6 | 44155312024315355 |
7 | 2543255225262602 |
oct | 301660344170367 |
9 | 52143514136408 |
10 | 13320900899063 |
11 | 42763a931189a |
12 | 15b181a912b5b |
13 | 758203a11604 |
14 | 340a40d61339 |
15 | 181791c19ac8 |
hex | c1d8390f0f7 |
13320900899063 has 2 divisors, whose sum is σ = 13320900899064. Its totient is φ = 13320900899062.
The previous prime is 13320900899057. The next prime is 13320900899069. The reversal of 13320900899063 is 36099800902331.
13320900899063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (13320900899057) and next prime (13320900899069).
It is a cyclic number.
It is not a de Polignac number, because 13320900899063 - 26 = 13320900898999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13320900898996 and 13320900899014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13320900899069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660450449531 + 6660450449532.
It is an arithmetic number, because the mean of its divisors is an integer number (6660450449532).
Almost surely, 213320900899063 is an apocalyptic number.
13320900899063 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320900899063 is an equidigital number, since it uses as much as digits as its factorization.
13320900899063 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1889568, while the sum is 53.
The spelling of 13320900899063 in words is "thirteen trillion, three hundred twenty billion, nine hundred million, eight hundred ninety-nine thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •