Base | Representation |
---|---|
bin | 11000100010100111… |
… | …00100110101111001 |
3 | 1021000012112212001112 |
4 | 30101103210311321 |
5 | 203440330334301 |
6 | 10015211130105 |
7 | 644331513335 |
oct | 142123446571 |
9 | 37005485045 |
10 | 13175246201 |
11 | 56510a0527 |
12 | 2678443935 |
13 | 131c79cb90 |
14 | 8cdb467c5 |
15 | 521a1b9bb |
hex | 3114e4d79 |
13175246201 has 8 divisors (see below), whose sum is σ = 14217168000. Its totient is φ = 12137387472.
The previous prime is 13175246197. The next prime is 13175246207. The reversal of 13175246201 is 10264257131.
13175246201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13175246201 - 22 = 13175246197 is a prime.
It is a super-2 number, since 2×131752462012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13175246207) 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 7 ways as a sum of consecutive naturals, for example, 1009025 + ... + 1021998.
It is an arithmetic number, because the mean of its divisors is an integer number (1777146000).
Almost surely, 213175246201 is an apocalyptic number.
It is an amenable number.
13175246201 is a deficient number, since it is larger than the sum of its proper divisors (1041921799).
13175246201 is a wasteful number, since it uses less digits than its factorization.
13175246201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2031535.
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 13175246201 in words is "thirteen billion, one hundred seventy-five million, two hundred forty-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •