Base | Representation |
---|---|
bin | 1100001100010011000111… |
… | …1011001110011100110001 |
3 | 1202110112202111120220210102 |
4 | 3003010301323032130301 |
5 | 3224113310204240311 |
6 | 44302211512042145 |
7 | 2552340031336646 |
oct | 303046173163461 |
9 | 52415674526712 |
10 | 13405430540081 |
11 | 42a9236074248 |
12 | 160608b693355 |
13 | 7631853ca688 |
14 | 344b7d51ddcd |
15 | 183a8cbce43b |
hex | c3131ece731 |
13405430540081 has 2 divisors, whose sum is σ = 13405430540082. Its totient is φ = 13405430540080.
The previous prime is 13405430540077. The next prime is 13405430540113. The reversal of 13405430540081 is 18004503450431.
13405430540081 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., 7040956110400 + 6364474429681 = 2653480^2 + 2522791^2 .
It is a cyclic number.
It is not a de Polignac number, because 13405430540081 - 22 = 13405430540077 is a prime.
It is a super-2 number, since 2×134054305400812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13405430540581) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6702715270040 + 6702715270041.
It is an arithmetic number, because the mean of its divisors is an integer number (6702715270041).
Almost surely, 213405430540081 is an apocalyptic number.
It is an amenable number.
13405430540081 is a deficient number, since it is larger than the sum of its proper divisors (1).
13405430540081 is an equidigital number, since it uses as much as digits as its factorization.
13405430540081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 13405430540081 in words is "thirteen trillion, four hundred five billion, four hundred thirty million, five hundred forty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •