Base | Representation |
---|---|
bin | 1011010110001000… |
… | …10001011001101101 |
3 | 120201111202112010111 |
4 | 11223010101121231 |
5 | 44433324434021 |
6 | 2444232340021 |
7 | 303642523126 |
oct | 55304213155 |
9 | 16644675114 |
10 | 6091249261 |
11 | 26463957a9 |
12 | 121bb44611 |
13 | 760c67506 |
14 | 41ada304d |
15 | 259b5e8e1 |
hex | 16b11166d |
6091249261 has 8 divisors (see below), whose sum is σ = 6136296824. Its totient is φ = 6046341120.
The previous prime is 6091249217. The next prime is 6091249279. The reversal of 6091249261 is 1629421906.
It can be written as a sum of positive squares in 4 ways, for example, as 1616442025 + 4474807236 = 40205^2 + 66894^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6091249261 - 27 = 6091249133 is a prime.
It is a super-2 number, since 2×60912492612 = 74206635119266092242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6091249211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53671 + ... + 122731.
It is an arithmetic number, because the mean of its divisors is an integer number (767037103).
Almost surely, 26091249261 is an apocalyptic number.
It is an amenable number.
6091249261 is a deficient number, since it is larger than the sum of its proper divisors (45047563).
6091249261 is a wasteful number, since it uses less digits than its factorization.
6091249261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69711.
The product of its (nonzero) digits is 46656, while the sum is 40.
The square root of 6091249261 is about 78046.4557875628. The cubic root of 6091249261 is about 1826.2860028073.
The spelling of 6091249261 in words is "six billion, ninety-one million, two hundred forty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •