Base | Representation |
---|---|
bin | 1100001000100111010110… |
… | …1100011011000110110011 |
3 | 1202020111101212220211020220 |
4 | 3002021311230123012303 |
5 | 3222044202102013021 |
6 | 44213143524304123 |
7 | 2544636512206146 |
oct | 302116554330663 |
9 | 52214355824226 |
10 | 13342143001011 |
11 | 4284409993450 |
12 | 15b5968842043 |
13 | 75a20a831bc6 |
14 | 341a981b605d |
15 | 1820d6a3acc6 |
hex | c2275b1b1b3 |
13342143001011 has 32 divisors (see below), whose sum is σ = 20314407495168. Its totient is φ = 7710176221440.
The previous prime is 13342143000997. The next prime is 13342143001027. The reversal of 13342143001011 is 11010034124331.
It is a happy number.
13342143001011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13342143001011 - 27 = 13342143000883 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13342143051011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27485866 + ... + 27967071.
It is an arithmetic number, because the mean of its divisors is an integer number (634825234224).
Almost surely, 213342143001011 is an apocalyptic number.
13342143001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13342143001011 is a deficient number, since it is larger than the sum of its proper divisors (6972264494157).
13342143001011 is a wasteful number, since it uses less digits than its factorization.
13342143001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55453291.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13342143001011 its reverse (11010034124331), we get a palindrome (24352177125342).
The spelling of 13342143001011 in words is "thirteen trillion, three hundred forty-two billion, one hundred forty-three million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •