Base | Representation |
---|---|
bin | 1011111100010001100110… |
… | …0100111000010101100011 |
3 | 1201111020012022121221101222 |
4 | 2333010121210320111203 |
5 | 3210111013343402321 |
6 | 43531523244445255 |
7 | 2523423132365204 |
oct | 277043144702543 |
9 | 51436168557358 |
10 | 13130144122211 |
11 | 4202510066a96 |
12 | 158086284982b |
13 | 74322368165c |
14 | 3357066c95ab |
15 | 17b829eb83ab |
hex | bf119938563 |
13130144122211 has 2 divisors, whose sum is σ = 13130144122212. Its totient is φ = 13130144122210.
The previous prime is 13130144122181. The next prime is 13130144122213. The reversal of 13130144122211 is 11222144103131.
It is a happy number.
13130144122211 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 13130144122211 - 210 = 13130144121187 is a prime.
Together with 13130144122213, 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 (13130144122213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565072061105 + 6565072061106.
It is an arithmetic number, because the mean of its divisors is an integer number (6565072061106).
Almost surely, 213130144122211 is an apocalyptic number.
13130144122211 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130144122211 is an equidigital number, since it uses as much as digits as its factorization.
13130144122211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 13130144122211 its reverse (11222144103131), we get a palindrome (24352288225342).
The spelling of 13130144122211 in words is "thirteen trillion, one hundred thirty billion, one hundred forty-four million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •