Base | Representation |
---|---|
bin | 11001000001011110… |
… | …11001110000011011 |
3 | 1021200020211000121102 |
4 | 30200233121300123 |
5 | 210003123332232 |
6 | 10101021302015 |
7 | 653624544062 |
oct | 144057316033 |
9 | 37606730542 |
10 | 13434199067 |
11 | 5774289663 |
12 | 272b10490b |
13 | 1361328623 |
14 | 9162b31d9 |
15 | 53961d662 |
hex | 320bd9c1b |
13434199067 has 2 divisors, whose sum is σ = 13434199068. Its totient is φ = 13434199066.
The previous prime is 13434199003. The next prime is 13434199069. The reversal of 13434199067 is 76099143431.
13434199067 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 13434199067 - 26 = 13434199003 is a prime.
Together with 13434199069, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13434199069) 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, 6717099533 + 6717099534.
It is an arithmetic number, because the mean of its divisors is an integer number (6717099534).
Almost surely, 213434199067 is an apocalyptic number.
13434199067 is a deficient number, since it is larger than the sum of its proper divisors (1).
13434199067 is an equidigital number, since it uses as much as digits as its factorization.
13434199067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 489888, while the sum is 47.
The spelling of 13434199067 in words is "thirteen billion, four hundred thirty-four million, one hundred ninety-nine thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •