Base | Representation |
---|---|
bin | 110000000010101… |
… | …100000111100001 |
3 | 2002011122121201122 |
4 | 300002230013201 |
5 | 3122314330421 |
6 | 211551342025 |
7 | 25654661231 |
oct | 6002540741 |
9 | 2064577648 |
10 | 806011361 |
11 | 383a772a1 |
12 | 1a5b21915 |
13 | caca90cc |
14 | 79091cc1 |
15 | 4ab632ab |
hex | 300ac1e1 |
806011361 has 16 divisors (see below), whose sum is σ = 869730048. Its totient is φ = 744172800.
The previous prime is 806011351. The next prime is 806011387. The reversal of 806011361 is 163110608.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-806011361 is a prime.
It is a super-2 number, since 2×8060113612 = 1299308628122144642, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 806011361.
It is not an unprimeable number, because it can be changed into a prime (806011301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 508376 + ... + 509958.
It is an arithmetic number, because the mean of its divisors is an integer number (54358128).
Almost surely, 2806011361 is an apocalyptic number.
It is an amenable number.
806011361 is a deficient number, since it is larger than the sum of its proper divisors (63718687).
806011361 is a wasteful number, since it uses less digits than its factorization.
806011361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2152.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 806011361 is about 28390.3392195303. The cubic root of 806011361 is about 930.6371557760.
Adding to 806011361 its reverse (163110608), we get a palindrome (969121969).
The spelling of 806011361 in words is "eight hundred six million, eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •