Base | Representation |
---|---|
bin | 1100001110100010000100… |
… | …1010111000010100000011 |
3 | 1202121012210211021121021220 |
4 | 3003220201022320110003 |
5 | 3230230402324333312 |
6 | 44331555351250123 |
7 | 2555165666461650 |
oct | 303504112702403 |
9 | 52535724247256 |
10 | 13443804136707 |
11 | 4313537a5736a |
12 | 16115ba979943 |
13 | 76698c531279 |
14 | 34697dac2c27 |
15 | 184a869edc8c |
hex | c3a212b8503 |
13443804136707 has 32 divisors (see below), whose sum is σ = 20500626931200. Its totient is φ = 7676614487808.
The previous prime is 13443804136703. The next prime is 13443804136709. The reversal of 13443804136707 is 70763140834431.
It is not a de Polignac number, because 13443804136707 - 22 = 13443804136703 is a prime.
It is a super-2 number, since 2×134438041367072 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13443804136707.
It is not an unprimeable number, because it can be changed into a prime (13443804136703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 173302173 + ... + 173379729.
It is an arithmetic number, because the mean of its divisors is an integer number (640644591600).
Almost surely, 213443804136707 is an apocalyptic number.
13443804136707 is a deficient number, since it is larger than the sum of its proper divisors (7056822794493).
13443804136707 is a wasteful number, since it uses less digits than its factorization.
13443804136707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83435.
The product of its (nonzero) digits is 4064256, while the sum is 51.
The spelling of 13443804136707 in words is "thirteen trillion, four hundred forty-three billion, eight hundred four million, one hundred thirty-six thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •