Base | Representation |
---|---|
bin | 1011111011110001000010… |
… | …1000000101000111010111 |
3 | 1201110101122012121022211122 |
4 | 2332330100220011013113 |
5 | 3204440113413001242 |
6 | 43523520110154155 |
7 | 2522663424010055 |
oct | 276742050050727 |
9 | 51411565538748 |
10 | 13121404031447 |
11 | 41a9835557488 |
12 | 157b0237b295b |
13 | 74245ca0320a |
14 | 335117a0d1d5 |
15 | 17b4b7a2bad2 |
hex | bef10a051d7 |
13121404031447 has 2 divisors, whose sum is σ = 13121404031448. Its totient is φ = 13121404031446.
The previous prime is 13121404031377. The next prime is 13121404031471. The reversal of 13121404031447 is 74413040412131.
It is a happy number.
13121404031447 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 an emirp because it is prime and its reverse (74413040412131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13121404031447 - 220 = 13121402982871 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13121404031947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560702015723 + 6560702015724.
It is an arithmetic number, because the mean of its divisors is an integer number (6560702015724).
Almost surely, 213121404031447 is an apocalyptic number.
13121404031447 is a deficient number, since it is larger than the sum of its proper divisors (1).
13121404031447 is an equidigital number, since it uses as much as digits as its factorization.
13121404031447 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32256, while the sum is 35.
Adding to 13121404031447 its reverse (74413040412131), we get a palindrome (87534444443578).
The spelling of 13121404031447 in words is "thirteen trillion, one hundred twenty-one billion, four hundred four million, thirty-one thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •