Base | Representation |
---|---|
bin | 1011100000111100… |
… | …1110111010000001 |
3 | 21222102021010012002 |
4 | 2320033032322001 |
5 | 22312244012321 |
6 | 1230414513345 |
7 | 136412034416 |
oct | 27017167201 |
9 | 7872233162 |
10 | 3091000961 |
11 | 1346875854 |
12 | 723205855 |
13 | 3a34c6c69 |
14 | 21473410d |
15 | 13156c20b |
hex | b83cee81 |
3091000961 has 2 divisors, whose sum is σ = 3091000962. Its totient is φ = 3091000960.
The previous prime is 3091000909. The next prime is 3091000999. The reversal of 3091000961 is 1690001903.
3091000961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3089692225 + 1308736 = 55585^2 + 1144^2 .
It is a cyclic number.
It is not a de Polignac number, because 3091000961 - 218 = 3090738817 is a prime.
It is a super-3 number, since 3×30910009613 (a number of 29 digits) contains 333 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 (3091000361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1545500480 + 1545500481.
It is an arithmetic number, because the mean of its divisors is an integer number (1545500481).
Almost surely, 23091000961 is an apocalyptic number.
It is an amenable number.
3091000961 is a deficient number, since it is larger than the sum of its proper divisors (1).
3091000961 is an equidigital number, since it uses as much as digits as its factorization.
3091000961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 29.
The square root of 3091000961 is about 55596.7711382595. The cubic root of 3091000961 is about 1456.6874547760.
The spelling of 3091000961 in words is "three billion, ninety-one million, nine hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •