Base | Representation |
---|---|
bin | 1100001110100000010001… |
… | …1100001101010101100101 |
3 | 1202121011120020022122010012 |
4 | 3003220010130031111211 |
5 | 3230223410431440010 |
6 | 44331435452340005 |
7 | 2555151024536522 |
oct | 303500434152545 |
9 | 52534506278105 |
10 | 13443322140005 |
11 | 431330a97708a |
12 | 16114a5474605 |
13 | 766913710814 |
14 | 346935a96149 |
15 | 184a59540005 |
hex | c3a0470d565 |
13443322140005 has 16 divisors (see below), whose sum is σ = 16136684391744. Its totient is φ = 10751526339840.
The previous prime is 13443322139983. The next prime is 13443322140067. The reversal of 13443322140005 is 50004122334431.
It is not a de Polignac number, because 13443322140005 - 26 = 13443322139941 is a prime.
It is a super-2 number, since 2×134433221400052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 274850762 + ... + 274899668.
It is an arithmetic number, because the mean of its divisors is an integer number (1008542774484).
Almost surely, 213443322140005 is an apocalyptic number.
It is an amenable number.
13443322140005 is a deficient number, since it is larger than the sum of its proper divisors (2693362251739).
13443322140005 is an equidigital number, since it uses as much as digits as its factorization.
13443322140005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63796.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 13443322140005 its reverse (50004122334431), we get a palindrome (63447444474436).
The spelling of 13443322140005 in words is "thirteen trillion, four hundred forty-three billion, three hundred twenty-two million, one hundred forty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •