Base | Representation |
---|---|
bin | 100000000101011… |
… | …1101010100010101 |
3 | 2210000211200100012 |
4 | 1000022331110111 |
5 | 4201103130141 |
6 | 254455330005 |
7 | 35452033361 |
oct | 10012752425 |
9 | 2700750305 |
10 | 1076614421 |
11 | 5027a2393 |
12 | 260680905 |
13 | 14208356c |
14 | a2db22a1 |
15 | 647b6ceb |
hex | 402bd515 |
1076614421 has 2 divisors, whose sum is σ = 1076614422. Its totient is φ = 1076614420.
The previous prime is 1076614397. The next prime is 1076614507. The reversal of 1076614421 is 1244166701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1070009521 + 6604900 = 32711^2 + 2570^2 .
It is a cyclic number.
It is not a de Polignac number, because 1076614421 - 222 = 1072420117 is a prime.
It is a super-2 number, since 2×10766144212 = 2318197223010330482, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1076614321) 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, 538307210 + 538307211.
It is an arithmetic number, because the mean of its divisors is an integer number (538307211).
Almost surely, 21076614421 is an apocalyptic number.
It is an amenable number.
1076614421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1076614421 is an equidigital number, since it uses as much as digits as its factorization.
1076614421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 1076614421 is about 32811.8030745035. The cubic root of 1076614421 is about 1024.9123608591.
The spelling of 1076614421 in words is "one billion, seventy-six million, six hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •