Base | Representation |
---|---|
bin | 111000110101000… |
… | …0111010001010000 |
3 | 11220220002210100020 |
4 | 1301222013101100 |
5 | 12401124141412 |
6 | 513114423440 |
7 | 65153041566 |
oct | 16152072120 |
9 | 4826083306 |
10 | 1906865232 |
11 | 899415088 |
12 | 452731b80 |
13 | 24509862c |
14 | 141373a36 |
15 | b261718c |
hex | 71a87450 |
1906865232 has 80 divisors (see below), whose sum is σ = 5410844160. Its totient is φ = 575980416.
The previous prime is 1906865201. The next prime is 1906865237. The reversal of 1906865232 is 2325686091.
It is a super-2 number, since 2×19068652322 = 7272270026020827648, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1906865237) 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 15 ways as a sum of consecutive naturals, for example, 24478 + ... + 66429.
It is an arithmetic number, because the mean of its divisors is an integer number (67635552).
Almost surely, 21906865232 is an apocalyptic number.
1906865232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1906865232 is an abundant number, since it is smaller than the sum of its proper divisors (3503978928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1906865232 is a wasteful number, since it uses less digits than its factorization.
1906865232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90960 (or 90954 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The square root of 1906865232 is about 43667.6680394087. The cubic root of 1906865232 is about 1240.0522940138.
The spelling of 1906865232 in words is "one billion, nine hundred six million, eight hundred sixty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •