Base | Representation |
---|---|
bin | 100110110100011001101 |
3 | 2101121212121 |
4 | 10312203031 |
5 | 311201023 |
6 | 43132541 |
7 | 13545331 |
oct | 4664315 |
9 | 2347777 |
10 | 1272013 |
11 | 799756 |
12 | 514151 |
13 | 356c92 |
14 | 2517c1 |
15 | 1a1d5d |
hex | 1368cd |
1272013 has 4 divisors (see below), whose sum is σ = 1280700. Its totient is φ = 1263328.
The previous prime is 1272001. The next prime is 1272043. The reversal of 1272013 is 3102721.
It is a happy number.
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 636804 + 635209 = 798^2 + 797^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1272013 is a prime.
It is a Duffinian number.
1272013 is a lucky number.
It is a plaindrome in base 9 and base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1272043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4120 + ... + 4417.
It is an arithmetic number, because the mean of its divisors is an integer number (320175).
21272013 is an apocalyptic number.
1272013 is the 798-th centered square number.
It is an amenable number.
1272013 is a deficient number, since it is larger than the sum of its proper divisors (8687).
1272013 is an equidigital number, since it uses as much as digits as its factorization.
1272013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8686.
The product of its (nonzero) digits is 84, while the sum is 16.
The square root of 1272013 is about 1127.8355376561. The cubic root of 1272013 is about 108.3503994153.
Adding to 1272013 its reverse (3102721), we get a palindrome (4374734).
The spelling of 1272013 in words is "one million, two hundred seventy-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •