Base | Representation |
---|---|
bin | 10101101101001100100111 |
3 | 101201002102100 |
4 | 111231030213 |
5 | 2424041101 |
6 | 321543143 |
7 | 66236235 |
oct | 25551447 |
9 | 11632370 |
10 | 5690151 |
11 | 3237105 |
12 | 1aa4ab3 |
13 | 1242c6c |
14 | a81955 |
15 | 775e86 |
hex | 56d327 |
5690151 has 12 divisors (see below), whose sum is σ = 8273512. Its totient is φ = 3768336.
The previous prime is 5690129. The next prime is 5690159. The reversal of 5690151 is 1510965.
It is not a de Polignac number, because 5690151 - 27 = 5690023 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 (5690159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 601 + ... + 3426.
Almost surely, 25690151 is an apocalyptic number.
5690151 is a deficient number, since it is larger than the sum of its proper divisors (2583361).
5690151 is a wasteful number, since it uses less digits than its factorization.
5690151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4190 (or 4187 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 27.
The square root of 5690151 is about 2385.4037394118. The cubic root of 5690151 is about 178.5286539223.
The spelling of 5690151 in words is "five million, six hundred ninety thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •