Base | Representation |
---|---|
bin | 11001000001011110… |
… | …01001001111111101 |
3 | 1021200020200120212012 |
4 | 30200233021033331 |
5 | 210003114201303 |
6 | 10101020021005 |
7 | 653624143001 |
oct | 144057111775 |
9 | 37606616765 |
10 | 13434131453 |
11 | 5774242886 |
12 | 272b091765 |
13 | 1361303912 |
14 | 916296701 |
15 | 5396085d8 |
hex | 320bc93fd |
13434131453 has 2 divisors, whose sum is σ = 13434131454. Its totient is φ = 13434131452.
The previous prime is 13434131377. The next prime is 13434131531. The reversal of 13434131453 is 35413143431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11078194009 + 2355937444 = 105253^2 + 48538^2 .
It is an emirp because it is prime and its reverse (35413143431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13434131453 - 214 = 13434115069 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13434151453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6717065726 + 6717065727.
It is an arithmetic number, because the mean of its divisors is an integer number (6717065727).
Almost surely, 213434131453 is an apocalyptic number.
It is an amenable number.
13434131453 is a deficient number, since it is larger than the sum of its proper divisors (1).
13434131453 is an equidigital number, since it uses as much as digits as its factorization.
13434131453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25920, while the sum is 32.
Adding to 13434131453 its reverse (35413143431), we get a palindrome (48847274884).
The spelling of 13434131453 in words is "thirteen billion, four hundred thirty-four million, one hundred thirty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •