Base | Representation |
---|---|
bin | 100101111010011… |
… | …0101100111011101 |
3 | 10021122202112011112 |
4 | 1023310311213131 |
5 | 10101132023201 |
6 | 330122231405 |
7 | 43345013453 |
oct | 11364654735 |
9 | 3248675145 |
10 | 1272142301 |
11 | 5a3100381 |
12 | 2b6055565 |
13 | 173733131 |
14 | c0d4c9d3 |
15 | 76a3b0bb |
hex | 4bd359dd |
1272142301 has 4 divisors (see below), whose sum is σ = 1303170204. Its totient is φ = 1241114400.
The previous prime is 1272142297. The next prime is 1272142307. The reversal of 1272142301 is 1032412721.
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 477466201 + 794676100 = 21851^2 + 28190^2 .
It is a cyclic number.
It is not a de Polignac number, because 1272142301 - 22 = 1272142297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1272142307) 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 3 ways as a sum of consecutive naturals, for example, 15513890 + ... + 15513971.
It is an arithmetic number, because the mean of its divisors is an integer number (325792551).
Almost surely, 21272142301 is an apocalyptic number.
It is an amenable number.
1272142301 is a deficient number, since it is larger than the sum of its proper divisors (31027903).
1272142301 is an equidigital number, since it uses as much as digits as its factorization.
1272142301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31027902.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 1272142301 is about 35667.1039054196. The cubic root of 1272142301 is about 1083.5407058852.
The spelling of 1272142301 in words is "one billion, two hundred seventy-two million, one hundred forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •