Base | Representation |
---|---|
bin | 111110010110011… |
… | …0100111110001101 |
3 | 12101210201000110121 |
4 | 1330230310332031 |
5 | 13241041013333 |
6 | 543333304541 |
7 | 102562530661 |
oct | 17454647615 |
9 | 5353630417 |
10 | 2092126093 |
11 | 983a50332 |
12 | 4a4795151 |
13 | 274591c45 |
14 | 15bbda8a1 |
15 | c3a0e32d |
hex | 7cb34f8d |
2092126093 has 2 divisors, whose sum is σ = 2092126094. Its totient is φ = 2092126092.
The previous prime is 2092126031. The next prime is 2092126103. The reversal of 2092126093 is 3906212902.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2013945129 + 78180964 = 44877^2 + 8842^2 .
It is a cyclic number.
It is not a de Polignac number, because 2092126093 - 213 = 2092117901 is a prime.
It is a super-2 number, since 2×20921260932 = 8753983178022889298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2092126193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1046063046 + 1046063047.
It is an arithmetic number, because the mean of its divisors is an integer number (1046063047).
Almost surely, 22092126093 is an apocalyptic number.
It is an amenable number.
2092126093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2092126093 is an equidigital number, since it uses as much as digits as its factorization.
2092126093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 34.
The square root of 2092126093 is about 45739.7648988274. The cubic root of 2092126093 is about 1278.9766586748.
Adding to 2092126093 its reverse (3906212902), we get a palindrome (5998338995).
The spelling of 2092126093 in words is "two billion, ninety-two million, one hundred twenty-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •