Base | Representation |
---|---|
bin | 1011110110000100110110… |
… | …0001000111010010100111 |
3 | 1201010001021221220102222022 |
4 | 2331201031201013102213 |
5 | 3201334404142231334 |
6 | 43410551145053355 |
7 | 2512632655042613 |
oct | 275411541072247 |
9 | 51101257812868 |
10 | 13023641367719 |
11 | 4171328032224 |
12 | 156409b18725b |
13 | 73617c8983b8 |
14 | 3304c1b88343 |
15 | 178b94e3682e |
hex | bd84d8474a7 |
13023641367719 has 2 divisors, whose sum is σ = 13023641367720. Its totient is φ = 13023641367718.
The previous prime is 13023641367673. The next prime is 13023641367721. The reversal of 13023641367719 is 91776314632031.
It is a happy number.
13023641367719 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 13023641367719 - 216 = 13023641302183 is a prime.
It is a super-2 number, since 2×130236413677192 (a number of 27 digits) contains 22 as substring.
Together with 13023641367721, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13023641667719) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511820683859 + 6511820683860.
It is an arithmetic number, because the mean of its divisors is an integer number (6511820683860).
Almost surely, 213023641367719 is an apocalyptic number.
13023641367719 is a deficient number, since it is larger than the sum of its proper divisors (1).
13023641367719 is an equidigital number, since it uses as much as digits as its factorization.
13023641367719 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3429216, while the sum is 53.
The spelling of 13023641367719 in words is "thirteen trillion, twenty-three billion, six hundred forty-one million, three hundred sixty-seven thousand, seven hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •