Base | Representation |
---|---|
bin | 1100011010001001011111… |
… | …1000100001110011010111 |
3 | 1210022021220111221210021211 |
4 | 3012202113320201303113 |
5 | 3242013102230411411 |
6 | 45003401450322251 |
7 | 2605462200121015 |
oct | 306422770416327 |
9 | 53267814853254 |
10 | 13643364310231 |
11 | 4390133520407 |
12 | 1644213129387 |
13 | 77c7436a6296 |
14 | 3524b15d38b5 |
15 | 189d66544221 |
hex | c6897e21cd7 |
13643364310231 has 2 divisors, whose sum is σ = 13643364310232. Its totient is φ = 13643364310230.
The previous prime is 13643364310223. The next prime is 13643364310273. The reversal of 13643364310231 is 13201346334631.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13643364310231 - 23 = 13643364310223 is a prime.
It is a super-2 number, since 2×136433643102312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13643364311231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6821682155115 + 6821682155116.
It is an arithmetic number, because the mean of its divisors is an integer number (6821682155116).
Almost surely, 213643364310231 is an apocalyptic number.
13643364310231 is a deficient number, since it is larger than the sum of its proper divisors (1).
13643364310231 is an equidigital number, since it uses as much as digits as its factorization.
13643364310231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 40.
The spelling of 13643364310231 in words is "thirteen trillion, six hundred forty-three billion, three hundred sixty-four million, three hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •