Base | Representation |
---|---|
bin | 111110000001011… |
… | …0001011010011111 |
3 | 12101000221220112021 |
4 | 1330002301122133 |
5 | 13230230221341 |
6 | 542301121011 |
7 | 102400033141 |
oct | 17402613237 |
9 | 5330856467 |
10 | 2081101471 |
11 | 978800379 |
12 | 4a0b59167 |
13 | 272201bb7 |
14 | 15a56ac91 |
15 | c2a829d1 |
hex | 7c0b169f |
2081101471 has 4 divisors (see below), whose sum is σ = 2081199744. Its totient is φ = 2081003200.
The previous prime is 2081101457. The next prime is 2081101489. The reversal of 2081101471 is 1741011802.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2081101471 is a prime.
It is a super-3 number, since 3×20811014713 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2081101441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2815 + ... + 64576.
It is an arithmetic number, because the mean of its divisors is an integer number (520299936).
Almost surely, 22081101471 is an apocalyptic number.
2081101471 is a deficient number, since it is larger than the sum of its proper divisors (98273).
2081101471 is an equidigital number, since it uses as much as digits as its factorization.
2081101471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98272.
The product of its (nonzero) digits is 448, while the sum is 25.
The square root of 2081101471 is about 45619.0910803799. The cubic root of 2081101471 is about 1276.7261451185.
The spelling of 2081101471 in words is "two billion, eighty-one million, one hundred one thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •