Base | Representation |
---|---|
bin | 1000000010100001… |
… | …1011111111101001 |
3 | 12120101211000210202 |
4 | 2000220123333221 |
5 | 13404432142243 |
6 | 554051121545 |
7 | 104323261205 |
oct | 20050337751 |
9 | 5511730722 |
10 | 2158084073 |
11 | a08200562 |
12 | 5028a32b5 |
13 | 285146a32 |
14 | 166889b05 |
15 | c96dc4b8 |
hex | 80a1bfe9 |
2158084073 has 2 divisors, whose sum is σ = 2158084074. Its totient is φ = 2158084072.
The previous prime is 2158084067. The next prime is 2158084099. The reversal of 2158084073 is 3704808512.
2158084073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2004621529 + 153462544 = 44773^2 + 12388^2 .
It is a cyclic number.
It is not a de Polignac number, because 2158084073 - 226 = 2090975209 is a prime.
It is a super-2 number, since 2×21580840732 = 9314653732272538658, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2158084013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1079042036 + 1079042037.
It is an arithmetic number, because the mean of its divisors is an integer number (1079042037).
Almost surely, 22158084073 is an apocalyptic number.
It is an amenable number.
2158084073 is a deficient number, since it is larger than the sum of its proper divisors (1).
2158084073 is an equidigital number, since it uses as much as digits as its factorization.
2158084073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 53760, while the sum is 38.
The square root of 2158084073 is about 46455.1834890360. The cubic root of 2158084073 is about 1292.2785028494.
The spelling of 2158084073 in words is "two billion, one hundred fifty-eight million, eighty-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •