Base | Representation |
---|---|
bin | 1011000010000001… |
… | …1111000111110101 |
3 | 21122101012221021202 |
4 | 2300200133013311 |
5 | 22031043243401 |
6 | 1205503022245 |
7 | 133245454325 |
oct | 26040370765 |
9 | 7571187252 |
10 | 2961306101 |
11 | 128a642116 |
12 | 6a789a985 |
13 | 382687340 |
14 | 201413285 |
15 | 124e9e06b |
hex | b081f1f5 |
2961306101 has 16 divisors (see below), whose sum is σ = 3256525104. Its totient is φ = 2676271104.
The previous prime is 2961306091. The next prime is 2961306107. The reversal of 2961306101 is 1016031692.
2961306101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 39363076 + 2921943025 = 6274^2 + 54055^2 .
It is not a de Polignac number, because 2961306101 - 226 = 2894197237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2961306107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118625 + ... + 141401.
It is an arithmetic number, because the mean of its divisors is an integer number (203532819).
Almost surely, 22961306101 is an apocalyptic number.
It is an amenable number.
2961306101 is a deficient number, since it is larger than the sum of its proper divisors (295219003).
2961306101 is a wasteful number, since it uses less digits than its factorization.
2961306101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23000.
The product of its (nonzero) digits is 1944, while the sum is 29.
The square root of 2961306101 is about 54417.8840180322. The cubic root of 2961306101 is about 1436.0220233702.
Adding to 2961306101 its reverse (1016031692), we get a palindrome (3977337793).
The spelling of 2961306101 in words is "two billion, nine hundred sixty-one million, three hundred six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •