Base | Representation |
---|---|
bin | 11101000110011011101… |
… | …100111000110011001101 |
3 | 21002011202112212200022201 |
4 | 131012123230320303031 |
5 | 230231013114344414 |
6 | 4130403234441501 |
7 | 264323133530002 |
oct | 35063354706315 |
9 | 7064675780281 |
10 | 1999772028109 |
11 | 70110a1a3169 |
12 | 28369b733291 |
13 | 11676826526b |
14 | 6cb0a4a98a9 |
15 | 37042e9a574 |
hex | 1d19bb38ccd |
1999772028109 has 2 divisors, whose sum is σ = 1999772028110. Its totient is φ = 1999772028108.
The previous prime is 1999772028041. The next prime is 1999772028157. The reversal of 1999772028109 is 9018202779991.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1079774530884 + 919997497225 = 1039122^2 + 959165^2 .
It is a cyclic number.
It is not a de Polignac number, because 1999772028109 - 29 = 1999772027597 is a prime.
It is a super-2 number, since 2×19997720281092 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1999772028169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 999886014054 + 999886014055.
It is an arithmetic number, because the mean of its divisors is an integer number (999886014055).
Almost surely, 21999772028109 is an apocalyptic number.
It is an amenable number.
1999772028109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1999772028109 is an equidigital number, since it uses as much as digits as its factorization.
1999772028109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10287648, while the sum is 64.
The spelling of 1999772028109 in words is "one trillion, nine hundred ninety-nine billion, seven hundred seventy-two million, twenty-eight thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •