Base | Representation |
---|---|
bin | 111101110000010… |
… | …010001001001001 |
3 | 2200012112200021201 |
4 | 331300102021021 |
5 | 4110213124101 |
6 | 250450304201 |
7 | 34450266445 |
oct | 7560221111 |
9 | 2605480251 |
10 | 1036067401 |
11 | 491918856 |
12 | 24ab88061 |
13 | 136857a45 |
14 | 9b859825 |
15 | 60e57e01 |
hex | 3dc12249 |
1036067401 has 2 divisors, whose sum is σ = 1036067402. Its totient is φ = 1036067400.
The previous prime is 1036067299. The next prime is 1036067437. The reversal of 1036067401 is 1047606301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 988788025 + 47279376 = 31445^2 + 6876^2 .
It is a cyclic number.
It is not a de Polignac number, because 1036067401 - 27 = 1036067273 is a prime.
It is a super-3 number, since 3×10360674013 (a number of 28 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1036067401.
It is not a weakly prime, because it can be changed into another prime (1036067441) 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 as a sum of consecutive naturals, namely, 518033700 + 518033701.
It is an arithmetic number, because the mean of its divisors is an integer number (518033701).
Almost surely, 21036067401 is an apocalyptic number.
It is an amenable number.
1036067401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1036067401 is an equidigital number, since it uses as much as digits as its factorization.
1036067401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 1036067401 is about 32188.0008854231. Note that the first 3 decimals coincide. The cubic root of 1036067401 is about 1011.8807556464.
The spelling of 1036067401 in words is "one billion, thirty-six million, sixty-seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •