Base | Representation |
---|---|
bin | 1000011111001010… |
… | …1001111011001001 |
3 | 12212202211201002220 |
4 | 2013302221323021 |
5 | 14131204444311 |
6 | 1014021444253 |
7 | 110312256330 |
oct | 20762517311 |
9 | 5782751086 |
10 | 2278203081 |
11 | a69a93770 |
12 | 536b70689 |
13 | 2a3cb2b7b |
14 | 1787d6d17 |
15 | d5018206 |
hex | 87ca9ec9 |
2278203081 has 64 divisors (see below), whose sum is σ = 3897163776. Its totient is φ = 1149422400.
The previous prime is 2278203029. The next prime is 2278203121. The reversal of 2278203081 is 1803028722.
It is not a de Polignac number, because 2278203081 - 218 = 2277940937 is a prime.
It is a super-2 number, since 2×22782030812 = 10380418556555785122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (2278203001) 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 63 ways as a sum of consecutive naturals, for example, 2095320 + ... + 2096406.
It is an arithmetic number, because the mean of its divisors is an integer number (60893184).
Almost surely, 22278203081 is an apocalyptic number.
2278203081 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2278203081 is a deficient number, since it is larger than the sum of its proper divisors (1618960695).
2278203081 is a wasteful number, since it uses less digits than its factorization.
2278203081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1362.
The product of its (nonzero) digits is 10752, while the sum is 33.
The square root of 2278203081 is about 47730.5256727809. The cubic root of 2278203081 is about 1315.8230147963.
The spelling of 2278203081 in words is "two billion, two hundred seventy-eight million, two hundred three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •