Base | Representation |
---|---|
bin | 111011100100110… |
… | …1010100001001001 |
3 | 12011022111211212112 |
4 | 1313021222201021 |
5 | 13043222202103 |
6 | 530205552105 |
7 | 100352256632 |
oct | 16711524111 |
9 | 5138454775 |
10 | 1999022153 |
11 | 936439a27 |
12 | 479575635 |
13 | 25b1c425b |
14 | 14d6c2889 |
15 | ba76ccd8 |
hex | 7726a849 |
1999022153 has 2 divisors, whose sum is σ = 1999022154. Its totient is φ = 1999022152.
The previous prime is 1999022119. The next prime is 1999022159. The reversal of 1999022153 is 3512209991.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1281425209 + 717596944 = 35797^2 + 26788^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1999022153 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1999022153.
It is not a weakly prime, because it can be changed into another prime (1999022159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 999511076 + 999511077.
It is an arithmetic number, because the mean of its divisors is an integer number (999511077).
Almost surely, 21999022153 is an apocalyptic number.
It is an amenable number.
1999022153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1999022153 is an equidigital number, since it uses as much as digits as its factorization.
1999022153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 41.
The square root of 1999022153 is about 44710.4255515422. The cubic root of 1999022153 is about 1259.7156814183.
The spelling of 1999022153 in words is "one billion, nine hundred ninety-nine million, twenty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •