Base | Representation |
---|---|
bin | 11100000100011111… |
… | …00000101110111001 |
3 | 1102220020212122010211 |
4 | 32002033200232321 |
5 | 221330410144301 |
6 | 10531214311121 |
7 | 1042306640065 |
oct | 160217405671 |
9 | 42806778124 |
10 | 15070006201 |
11 | 6433697788 |
12 | 2b06ab84a1 |
13 | 15621ba643 |
14 | a2d648aa5 |
15 | 5d3042051 |
hex | 3823e0bb9 |
15070006201 has 4 divisors (see below), whose sum is σ = 15956477172. Its totient is φ = 14183535232.
The previous prime is 15070006181. The next prime is 15070006213. The reversal of 15070006201 is 10260007051.
15070006201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12661650576 + 2408355625 = 112524^2 + 49075^2 .
It is a cyclic number.
It is not a de Polignac number, because 15070006201 - 217 = 15069875129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15070007201) 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 3 ways as a sum of consecutive naturals, for example, 443235460 + ... + 443235493.
It is an arithmetic number, because the mean of its divisors is an integer number (3989119293).
Almost surely, 215070006201 is an apocalyptic number.
It is an amenable number.
15070006201 is a deficient number, since it is larger than the sum of its proper divisors (886470971).
15070006201 is an equidigital number, since it uses as much as digits as its factorization.
15070006201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 886470970.
The product of its (nonzero) digits is 420, while the sum is 22.
The spelling of 15070006201 in words is "fifteen billion, seventy million, six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •