Base | Representation |
---|---|
bin | 100101111011010… |
… | …1001010001110101 |
3 | 10021200122121000220 |
4 | 1023312221101311 |
5 | 10101242203203 |
6 | 330140324553 |
7 | 43352025612 |
oct | 11366512165 |
9 | 3250577026 |
10 | 1272616053 |
11 | 5a33a4305 |
12 | 2b6243759 |
13 | 17386a967 |
14 | c1033509 |
15 | 76ad1653 |
hex | 4bda9475 |
1272616053 has 4 divisors (see below), whose sum is σ = 1696821408. Its totient is φ = 848410700.
The previous prime is 1272616027. The next prime is 1272616063. The reversal of 1272616053 is 3506162721.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1272616053 - 29 = 1272615541 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1272616063) 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, 212102673 + ... + 212102678.
It is an arithmetic number, because the mean of its divisors is an integer number (424205352).
Almost surely, 21272616053 is an apocalyptic number.
It is an amenable number.
1272616053 is a deficient number, since it is larger than the sum of its proper divisors (424205355).
1272616053 is an equidigital number, since it uses as much as digits as its factorization.
1272616053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424205354.
The product of its (nonzero) digits is 15120, while the sum is 33.
The square root of 1272616053 is about 35673.7445889831. The cubic root of 1272616053 is about 1083.6751944738.
Adding to 1272616053 its reverse (3506162721), we get a palindrome (4778778774).
The spelling of 1272616053 in words is "one billion, two hundred seventy-two million, six hundred sixteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •