Base | Representation |
---|---|
bin | 111001001111010… |
… | …0100000000000001 |
3 | 11221211222022122201 |
4 | 1302132210000001 |
5 | 12413134130101 |
6 | 514325233201 |
7 | 65410644616 |
oct | 16236440001 |
9 | 4854868581 |
10 | 1920614401 |
11 | 8a6156032 |
12 | 457262801 |
13 | 247ba0834 |
14 | 14311250d |
15 | b3930e01 |
hex | 727a4001 |
1920614401 has 2 divisors, whose sum is σ = 1920614402. Its totient is φ = 1920614400.
The previous prime is 1920614387. The next prime is 1920614413. The reversal of 1920614401 is 1044160291.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1782528400 + 138086001 = 42220^2 + 11751^2 .
It is a cyclic number.
It is not a de Polignac number, because 1920614401 - 29 = 1920613889 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1920614401.
It is not a weakly prime, because it can be changed into another prime (1920615401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 960307200 + 960307201.
It is an arithmetic number, because the mean of its divisors is an integer number (960307201).
Almost surely, 21920614401 is an apocalyptic number.
It is an amenable number.
1920614401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1920614401 is an equidigital number, since it uses as much as digits as its factorization.
1920614401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
The square root of 1920614401 is about 43824.8148997802. The cubic root of 1920614401 is about 1243.0255637120.
Adding to 1920614401 its reverse (1044160291), we get a palindrome (2964774692).
The spelling of 1920614401 in words is "one billion, nine hundred twenty million, six hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •