Base | Representation |
---|---|
bin | 100110000010001… |
… | …1010011000001001 |
3 | 10021221102221121211 |
4 | 1030010122120021 |
5 | 10103203200113 |
6 | 330345533121 |
7 | 43424506456 |
oct | 11404323011 |
9 | 3257387554 |
10 | 1276225033 |
11 | 5a5439836 |
12 | 2b74a41a1 |
13 | 174532555 |
14 | c16d282d |
15 | 77095b3d |
hex | 4c11a609 |
1276225033 has 2 divisors, whose sum is σ = 1276225034. Its totient is φ = 1276225032.
The previous prime is 1276225021. The next prime is 1276225061. The reversal of 1276225033 is 3305226721.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 874503184 + 401721849 = 29572^2 + 20043^2 .
It is an emirp because it is prime and its reverse (3305226721) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1276225033 - 225 = 1242670601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1276224986 and 1276225004.
It is not a weakly prime, because it can be changed into another prime (1276225073) 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 as a sum of consecutive naturals, namely, 638112516 + 638112517.
It is an arithmetic number, because the mean of its divisors is an integer number (638112517).
Almost surely, 21276225033 is an apocalyptic number.
It is an amenable number.
1276225033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1276225033 is an equidigital number, since it uses as much as digits as its factorization.
1276225033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 31.
The square root of 1276225033 is about 35724.2919174054. The cubic root of 1276225033 is about 1084.6986167667.
The spelling of 1276225033 in words is "one billion, two hundred seventy-six million, two hundred twenty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •