Base | Representation |
---|---|
bin | 11000100111000000… |
… | …10100111000001001 |
3 | 1021002202222102002211 |
4 | 30103200110320021 |
5 | 204024302034423 |
6 | 10023010025121 |
7 | 645260235451 |
oct | 142340247011 |
9 | 37082872084 |
10 | 13212143113 |
11 | 566aa01744 |
12 | 26888781a1 |
13 | 132731b180 |
14 | 8d49ccd61 |
15 | 524da910d |
hex | 313814e09 |
13212143113 has 32 divisors (see below), whose sum is σ = 15850386720. Its totient is φ = 10895523840.
The previous prime is 13212143033. The next prime is 13212143129. The reversal of 13212143113 is 31134121231.
It can be written as a sum of positive squares in 16 ways, for example, as 2744397769 + 10467745344 = 52387^2 + 102312^2 .
It is a cyclic number.
It is not a de Polignac number, because 13212143113 - 213 = 13212134921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13212149113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 315553 + ... + 354961.
It is an arithmetic number, because the mean of its divisors is an integer number (495324585).
Almost surely, 213212143113 is an apocalyptic number.
13212143113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13212143113 is a deficient number, since it is larger than the sum of its proper divisors (2638243607).
13212143113 is a wasteful number, since it uses less digits than its factorization.
13212143113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39517.
The product of its digits is 432, while the sum is 22.
Adding to 13212143113 its reverse (31134121231), we get a palindrome (44346264344).
The spelling of 13212143113 in words is "thirteen billion, two hundred twelve million, one hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •