Base | Representation |
---|---|
bin | 111001001111011… |
… | …0100000111001001 |
3 | 11221212002200011212 |
4 | 1302132310013021 |
5 | 12413143233033 |
6 | 514330502505 |
7 | 65411341202 |
oct | 16236640711 |
9 | 4855080155 |
10 | 1920680393 |
11 | 8a61a0675 |
12 | 457294a35 |
13 | 247bc4898 |
14 | 14312c5a9 |
15 | b3945748 |
hex | 727b41c9 |
1920680393 has 2 divisors, whose sum is σ = 1920680394. Its totient is φ = 1920680392.
The previous prime is 1920680387. The next prime is 1920680533. The reversal of 1920680393 is 3930860291.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1086163849 + 834516544 = 32957^2 + 28888^2 .
It is an emirp because it is prime and its reverse (3930860291) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1920680393 - 26 = 1920680329 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1920680393.
It is not a weakly prime, because it can be changed into another prime (1920686393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 960340196 + 960340197.
It is an arithmetic number, because the mean of its divisors is an integer number (960340197).
Almost surely, 21920680393 is an apocalyptic number.
It is an amenable number.
1920680393 is a deficient number, since it is larger than the sum of its proper divisors (1).
1920680393 is an equidigital number, since it uses as much as digits as its factorization.
1920680393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69984, while the sum is 41.
The square root of 1920680393 is about 43825.5678000867. The cubic root of 1920680393 is about 1243.0398002680.
It can be divided in two parts, 19206 and 80393, that added together give a palindrome (99599).
The spelling of 1920680393 in words is "one billion, nine hundred twenty million, six hundred eighty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •