Base | Representation |
---|---|
bin | 10000100100100… |
… | …110011100110101 |
3 | 201101011101122100 |
4 | 100210212130311 |
5 | 1032133431013 |
6 | 43331052313 |
7 | 6614134323 |
oct | 2044463465 |
9 | 641141570 |
10 | 278030133 |
11 | 132a39177 |
12 | 79141099 |
13 | 457a7b94 |
14 | 28cd4d13 |
15 | 1961e473 |
hex | 10926735 |
278030133 has 6 divisors (see below), whose sum is σ = 401599094. Its totient is φ = 185353416.
The previous prime is 278030119. The next prime is 278030147. The reversal of 278030133 is 331030872.
It is an interprime number because it is at equal distance from previous prime (278030119) and next prime (278030147).
It can be written as a sum of positive squares in only one way, i.e., 254147364 + 23882769 = 15942^2 + 4887^2 .
It is not a de Polignac number, because 278030133 - 29 = 278029621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 278030097 and 278030106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (278031133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15446110 + ... + 15446127.
Almost surely, 2278030133 is an apocalyptic number.
It is an amenable number.
278030133 is a deficient number, since it is larger than the sum of its proper divisors (123568961).
278030133 is a wasteful number, since it uses less digits than its factorization.
278030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30892243 (or 30892240 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 278030133 is about 16674.2356046687. The cubic root of 278030133 is about 652.6754678490.
The spelling of 278030133 in words is "two hundred seventy-eight million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •