Base | Representation |
---|---|
bin | 11000011001110011… |
… | …11010011101010011 |
3 | 1020211001121121000021 |
4 | 30030321322131103 |
5 | 203312430111011 |
6 | 10004012404311 |
7 | 642444101665 |
oct | 141471723523 |
9 | 36731547007 |
10 | 13101410131 |
11 | 561344a387 |
12 | 2657776697 |
13 | 130a3ba2b4 |
14 | 8c4006535 |
15 | 51a2d4471 |
hex | 30ce7a753 |
13101410131 has 2 divisors, whose sum is σ = 13101410132. Its totient is φ = 13101410130.
The previous prime is 13101410117. The next prime is 13101410159.
13101410131 is nontrivially palindromic in base 10.
It is a weak prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 13101410131 - 25 = 13101410099 is a prime.
It is a super-2 number, since 2×131014101312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13101413131) 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, 6550705065 + 6550705066.
It is an arithmetic number, because the mean of its divisors is an integer number (6550705066).
Almost surely, 213101410131 is an apocalyptic number.
13101410131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101410131 is an equidigital number, since it uses as much as digits as its factorization.
13101410131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The spelling of 13101410131 in words is "thirteen billion, one hundred one million, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •