Base | Representation |
---|---|
bin | 11000100111001111… |
… | …01011100011100101 |
3 | 1021002220121100200112 |
4 | 30103213223203211 |
5 | 204030300233023 |
6 | 10023115222405 |
7 | 645312515243 |
oct | 142347534345 |
9 | 37086540615 |
10 | 13214071013 |
11 | 5670aa9150 |
12 | 2689447a05 |
13 | 1327844840 |
14 | 8d4d71793 |
15 | 52513a478 |
hex | 3139eb8e5 |
13214071013 has 16 divisors (see below), whose sum is σ = 15527768256. Its totient is φ = 11086199040.
The previous prime is 13214070979. The next prime is 13214071063. The reversal of 13214071013 is 31017041231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13214071013 - 214 = 13214054629 is a prime.
It is a super-2 number, since 2×132140710132 (a number of 21 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 13214071013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13214071063) by changing a digit.
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, 879581 + ... + 894477.
It is an arithmetic number, because the mean of its divisors is an integer number (970485516).
Almost surely, 213214071013 is an apocalyptic number.
13214071013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13214071013 is a deficient number, since it is larger than the sum of its proper divisors (2313697243).
13214071013 is a wasteful number, since it uses less digits than its factorization.
13214071013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21124.
The product of its (nonzero) digits is 504, while the sum is 23.
The spelling of 13214071013 in words is "thirteen billion, two hundred fourteen million, seventy-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •