Base | Representation |
---|---|
bin | 100101110000110… |
… | …1101111010100101 |
3 | 10021022022212121112 |
4 | 1023201231322211 |
5 | 10043341130041 |
6 | 325422554405 |
7 | 43254266423 |
oct | 11341557245 |
9 | 3238285545 |
10 | 1267130021 |
11 | 5a02975a3 |
12 | 2b4438a05 |
13 | 1726998a1 |
14 | c0406113 |
15 | 7639adeb |
hex | 4b86dea5 |
1267130021 has 2 divisors, whose sum is σ = 1267130022. Its totient is φ = 1267130020.
The previous prime is 1267130017. The next prime is 1267130027. The reversal of 1267130021 is 1200317621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1170324100 + 96805921 = 34210^2 + 9839^2 .
It is a cyclic number.
It is not a de Polignac number, because 1267130021 - 22 = 1267130017 is a prime.
It is a super-3 number, since 3×12671300213 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1267130027) 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 as a sum of consecutive naturals, namely, 633565010 + 633565011.
It is an arithmetic number, because the mean of its divisors is an integer number (633565011).
Almost surely, 21267130021 is an apocalyptic number.
It is an amenable number.
1267130021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1267130021 is an equidigital number, since it uses as much as digits as its factorization.
1267130021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
The square root of 1267130021 is about 35596.7698113186. The cubic root of 1267130021 is about 1082.1157715203.
Adding to 1267130021 its reverse (1200317621), we get a palindrome (2467447642).
The spelling of 1267130021 in words is "one billion, two hundred sixty-seven million, one hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •