Base | Representation |
---|---|
bin | 100011110011010… |
… | …0110100111110001 |
3 | 10002201110110112201 |
4 | 1013212212213301 |
5 | 4430013131001 |
6 | 315112023201 |
7 | 41524620124 |
oct | 10746464761 |
9 | 3081413481 |
10 | 1201302001 |
11 | 567115a79 |
12 | 296391b01 |
13 | 161b5bcb3 |
14 | b578c3bb |
15 | 706e6501 |
hex | 479a69f1 |
1201302001 has 4 divisors (see below), whose sum is σ = 1201535604. Its totient is φ = 1201068400.
The previous prime is 1201301963. The next prime is 1201302007. The reversal of 1201302001 is 1002031021.
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 845413776 + 355888225 = 29076^2 + 18865^2 .
It is a cyclic number.
It is not a de Polignac number, because 1201302001 - 27 = 1201301873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1201302007) 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, 108910 + ... + 119431.
It is an arithmetic number, because the mean of its divisors is an integer number (300383901).
Almost surely, 21201302001 is an apocalyptic number.
It is an amenable number.
1201302001 is a deficient number, since it is larger than the sum of its proper divisors (233603).
1201302001 is an equidigital number, since it uses as much as digits as its factorization.
1201302001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233602.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1201302001 is about 34659.8038222954. The cubic root of 1201302001 is about 1063.0427587451.
Adding to 1201302001 its reverse (1002031021), we get a palindrome (2203333022).
The spelling of 1201302001 in words is "one billion, two hundred one million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •