Base | Representation |
---|---|
bin | 1011111010100101000100… |
… | …0111010001010111100001 |
3 | 1201101102222222201202102011 |
4 | 2332221101013101113201 |
5 | 3204121332321112231 |
6 | 43510304343152521 |
7 | 2521342161035446 |
oct | 276512107212741 |
9 | 51342888652364 |
10 | 13101011113441 |
11 | 41a112025a339 |
12 | 1577092145741 |
13 | 74055cac6624 |
14 | 3341414879cd |
15 | 17abc254a9b1 |
hex | bea511d15e1 |
13101011113441 has 2 divisors, whose sum is σ = 13101011113442. Its totient is φ = 13101011113440.
The previous prime is 13101011113417. The next prime is 13101011113517. The reversal of 13101011113441 is 14431111010131.
13101011113441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7044140646400 + 6056870467041 = 2654080^2 + 2461071^2 .
It is a cyclic number.
It is not a de Polignac number, because 13101011113441 - 213 = 13101011105249 is a prime.
It is not a weakly prime, because it can be changed into another prime (13101711113441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550505556720 + 6550505556721.
It is an arithmetic number, because the mean of its divisors is an integer number (6550505556721).
Almost surely, 213101011113441 is an apocalyptic number.
It is an amenable number.
13101011113441 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101011113441 is an equidigital number, since it uses as much as digits as its factorization.
13101011113441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 13101011113441 its reverse (14431111010131), we get a palindrome (27532122123572).
The spelling of 13101011113441 in words is "thirteen trillion, one hundred one billion, eleven million, one hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •