Base | Representation |
---|---|
bin | 111111010100001… |
… | …100111010110001 |
3 | 2202000211102022211 |
4 | 333110030322301 |
5 | 4133414313101 |
6 | 253223532121 |
7 | 35216031046 |
oct | 7724147261 |
9 | 2660742284 |
10 | 1062260401 |
11 | 4a5688a64 |
12 | 2578ba041 |
13 | 13c0c8c67 |
14 | a11171cd |
15 | 633cdc51 |
hex | 3f50ceb1 |
1062260401 has 4 divisors (see below), whose sum is σ = 1098890100. Its totient is φ = 1025630704.
The previous prime is 1062260393. The next prime is 1062260429. The reversal of 1062260401 is 1040622601.
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 862009600 + 200250801 = 29360^2 + 14151^2 .
It is not a de Polignac number, because 1062260401 - 23 = 1062260393 is a prime.
It is a super-2 number, since 2×10622604012 = 2256794319065361602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1062260461) 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 in 3 ways as a sum of consecutive naturals, for example, 18314806 + ... + 18314863.
It is an arithmetic number, because the mean of its divisors is an integer number (274722525).
Almost surely, 21062260401 is an apocalyptic number.
It is an amenable number.
1062260401 is a deficient number, since it is larger than the sum of its proper divisors (36629699).
1062260401 is an equidigital number, since it uses as much as digits as its factorization.
1062260401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36629698.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 1062260401 is about 32592.3365379041. The cubic root of 1062260401 is about 1020.3370669302.
The spelling of 1062260401 in words is "one billion, sixty-two million, two hundred sixty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •