Base | Representation |
---|---|
bin | 11101111000100… |
… | …01011000110001 |
3 | 122110200220112002 |
4 | 32330101120301 |
5 | 1003133242011 |
6 | 40512543345 |
7 | 6132516023 |
oct | 1674213061 |
9 | 573626462 |
10 | 250680881 |
11 | 119559290 |
12 | 6bb51b55 |
13 | 3cc205a9 |
14 | 25416013 |
15 | 1701ac3b |
hex | ef11631 |
250680881 has 4 divisors (see below), whose sum is σ = 273470064. Its totient is φ = 227891700.
The previous prime is 250680877. The next prime is 250680893. The reversal of 250680881 is 188086052.
250680881 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 250680881 - 22 = 250680877 is a prime.
It is a super-2 number, since 2×2506808812 = 125681808197872322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (250680811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11394575 + ... + 11394596.
It is an arithmetic number, because the mean of its divisors is an integer number (68367516).
Almost surely, 2250680881 is an apocalyptic number.
It is an amenable number.
250680881 is a deficient number, since it is larger than the sum of its proper divisors (22789183).
250680881 is a wasteful number, since it uses less digits than its factorization.
250680881 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22789182.
The product of its (nonzero) digits is 30720, while the sum is 38.
The square root of 250680881 is about 15832.9050082415. The cubic root of 250680881 is about 630.5319107362.
The spelling of 250680881 in words is "two hundred fifty million, six hundred eighty thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •