Base | Representation |
---|---|
bin | 110000010010110… |
… | …0101101010001001 |
3 | 11011221012012212212 |
4 | 1200211211222021 |
5 | 11304314410223 |
6 | 424444114505 |
7 | 55104510404 |
oct | 14045455211 |
9 | 4157165785 |
10 | 1620466313 |
11 | 761790364 |
12 | 392835a35 |
13 | 1ca95050b |
14 | 115300d3b |
15 | 973e3278 |
hex | 60965a89 |
1620466313 has 2 divisors, whose sum is σ = 1620466314. Its totient is φ = 1620466312.
The previous prime is 1620466307. The next prime is 1620466327. The reversal of 1620466313 is 3136640261.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1607448649 + 13017664 = 40093^2 + 3608^2 .
It is a cyclic number.
It is not a de Polignac number, because 1620466313 - 210 = 1620465289 is a prime.
It is a super-2 number, since 2×16204663132 = 5251822143135627938, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1620466313.
It is not a weakly prime, because it can be changed into another prime (1620466363) 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, 810233156 + 810233157.
It is an arithmetic number, because the mean of its divisors is an integer number (810233157).
Almost surely, 21620466313 is an apocalyptic number.
It is an amenable number.
1620466313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1620466313 is an equidigital number, since it uses as much as digits as its factorization.
1620466313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The square root of 1620466313 is about 40255.0159980095. The cubic root of 1620466313 is about 1174.5729700384.
The spelling of 1620466313 in words is "one billion, six hundred twenty million, four hundred sixty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •