Base | Representation |
---|---|
bin | 10110100010000011111010 |
3 | 102010002110000 |
4 | 112202003322 |
5 | 3003003212 |
6 | 330333430 |
7 | 101130435 |
oct | 26420372 |
9 | 12102400 |
10 | 5906682 |
11 | 3374861 |
12 | 1b8a276 |
13 | 12ba6a2 |
14 | ada81c |
15 | 7ba1dc |
hex | 5a20fa |
5906682 has 60 divisors (see below), whose sum is σ = 14106906. Its totient is φ = 1846800.
The previous prime is 5906629. The next prime is 5906683. The reversal of 5906682 is 2866095.
5906682 is a `hidden beast` number, since 590 + 6 + 68 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 3538161 + 2368521 = 1881^2 + 1539^2 .
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (5906683) 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 29 ways as a sum of consecutive naturals, for example, 58432 + ... + 58532.
Almost surely, 25906682 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5906682, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7053453).
5906682 is an abundant number, since it is smaller than the sum of its proper divisors (8200224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5906682 is a wasteful number, since it uses less digits than its factorization.
5906682 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153 (or 125 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 5906682 is about 2430.3666390074. The cubic root of 5906682 is about 180.7650768230.
The spelling of 5906682 in words is "five million, nine hundred six thousand, six hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •