Base | Representation |
---|---|
bin | 11001011011110111… |
… | …01001010000000011 |
3 | 1022020200020212222012 |
4 | 30231323221100003 |
5 | 210431302341232 |
6 | 10135005003135 |
7 | 662252636351 |
oct | 145573512003 |
9 | 38220225865 |
10 | 13655512067 |
11 | 58781a936a |
12 | 27912534ab |
13 | 1398135872 |
14 | 9378427d1 |
15 | 54dc879b2 |
hex | 32dee9403 |
13655512067 has 2 divisors, whose sum is σ = 13655512068. Its totient is φ = 13655512066.
The previous prime is 13655512027. The next prime is 13655512093. The reversal of 13655512067 is 76021555631.
13655512067 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 is a cyclic number.
It is not a de Polignac number, because 13655512067 - 214 = 13655495683 is a prime.
It is a super-2 number, since 2×136555120672 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13655512027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6827756033 + 6827756034.
It is an arithmetic number, because the mean of its divisors is an integer number (6827756034).
Almost surely, 213655512067 is an apocalyptic number.
13655512067 is a deficient number, since it is larger than the sum of its proper divisors (1).
13655512067 is an equidigital number, since it uses as much as digits as its factorization.
13655512067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189000, while the sum is 41.
The spelling of 13655512067 in words is "thirteen billion, six hundred fifty-five million, five hundred twelve thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •