Base | Representation |
---|---|
bin | 1100001100100101101101… |
… | …1101101101010000010111 |
3 | 1202111000122101200022011002 |
4 | 3003021123131231100113 |
5 | 3224204021114143221 |
6 | 44304355113133515 |
7 | 2552604524503211 |
oct | 303113335552027 |
9 | 52430571608132 |
10 | 13410422412311 |
11 | 430036792a791 |
12 | 16070433ba29b |
13 | 76379c671922 |
14 | 3450d44a75b1 |
15 | 183c8107c80b |
hex | c325b76d417 |
13410422412311 has 16 divisors (see below), whose sum is σ = 13950427448160. Its totient is φ = 12881193223680.
The previous prime is 13410422412293. The next prime is 13410422412313. The reversal of 13410422412311 is 11321422401431.
It is a de Polignac number, because none of the positive numbers 2k-13410422412311 is a prime.
It is a super-2 number, since 2×134104224123112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13410422412313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2294156 + ... + 5664273.
It is an arithmetic number, because the mean of its divisors is an integer number (871901715510).
Almost surely, 213410422412311 is an apocalyptic number.
13410422412311 is a deficient number, since it is larger than the sum of its proper divisors (540005035849).
13410422412311 is an equidigital number, since it uses as much as digits as its factorization.
13410422412311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7959106.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 13410422412311 its reverse (11321422401431), we get a palindrome (24731844813742).
The spelling of 13410422412311 in words is "thirteen trillion, four hundred ten billion, four hundred twenty-two million, four hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •