Base | Representation |
---|---|
bin | 11111000001000101011010 |
3 | 120022002111200 |
4 | 133001011122 |
5 | 4040142111 |
6 | 450135030 |
7 | 126053160 |
oct | 37010532 |
9 | 16262450 |
10 | 8130906 |
11 | 4653963 |
12 | 2881476 |
13 | 18b8bb4 |
14 | 1119230 |
15 | aa9256 |
hex | 7c115a |
8130906 has 48 divisors (see below), whose sum is σ = 20577024. Its totient is φ = 2272032.
The previous prime is 8130901. The next prime is 8130907. The reversal of 8130906 is 6090318.
It is a super-2 number, since 2×81309062 = 132223264761672, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 8130906.
It is not an unprimeable number, because it can be changed into a prime (8130901) 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 23 ways as a sum of consecutive naturals, for example, 5236 + ... + 6608.
It is an arithmetic number, because the mean of its divisors is an integer number (428688).
Almost surely, 28130906 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 8130906, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10288512).
8130906 is an abundant number, since it is smaller than the sum of its proper divisors (12446118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8130906 is a wasteful number, since it uses less digits than its factorization.
8130906 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1435 (or 1432 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 8130906 is about 2851.4743554870. The cubic root of 8130906 is about 201.0849867089.
The spelling of 8130906 in words is "eight million, one hundred thirty thousand, nine hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •