Base | Representation |
---|---|
bin | 100101110001110… |
… | …0010001110000001 |
3 | 10021100020002002020 |
4 | 1023203202032001 |
5 | 10044001401101 |
6 | 325441112053 |
7 | 43261322325 |
oct | 11343421601 |
9 | 3240202066 |
10 | 1267606401 |
11 | 5a05924a6 |
12 | 2b4628629 |
13 | 172805679 |
14 | c04cb985 |
15 | 76442136 |
hex | 4b8e2381 |
1267606401 has 4 divisors (see below), whose sum is σ = 1690141872. Its totient is φ = 845070932.
The previous prime is 1267606397. The next prime is 1267606463. The reversal of 1267606401 is 1046067621.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1046067621 = 3 ⋅348689207.
It is a cyclic number.
It is not a de Polignac number, because 1267606401 - 22 = 1267606397 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1267806401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211267731 + ... + 211267736.
It is an arithmetic number, because the mean of its divisors is an integer number (422535468).
Almost surely, 21267606401 is an apocalyptic number.
It is an amenable number.
1267606401 is a deficient number, since it is larger than the sum of its proper divisors (422535471).
1267606401 is an equidigital number, since it uses as much as digits as its factorization.
1267606401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422535470.
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 1267606401 is about 35603.4605200113. The cubic root of 1267606401 is about 1082.2513623740.
The spelling of 1267606401 in words is "one billion, two hundred sixty-seven million, six hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •