Base | Representation |
---|---|
bin | 111011001100111… |
… | …0000110011110100 |
3 | 12010102212212201020 |
4 | 1312121300303310 |
5 | 13032013340022 |
6 | 525040501140 |
7 | 100140450120 |
oct | 16631606364 |
9 | 5112785636 |
10 | 1986465012 |
11 | 92a342624 |
12 | 47531a7b0 |
13 | 2587187ac |
14 | 14bb74580 |
15 | b95dc35c |
hex | 76670cf4 |
1986465012 has 48 divisors (see below), whose sum is σ = 5527560192. Its totient is φ = 542884320.
The previous prime is 1986464999. The next prime is 1986465017. The reversal of 1986465012 is 2105646891.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1986465017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 512164 + ... + 516027.
It is an arithmetic number, because the mean of its divisors is an integer number (115157504).
Almost surely, 21986465012 is an apocalyptic number.
1986465012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1986465012 is an abundant number, since it is smaller than the sum of its proper divisors (3541095180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1986465012 is a wasteful number, since it uses less digits than its factorization.
1986465012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1028228 (or 1028226 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 42.
The square root of 1986465012 is about 44569.7768897265. The cubic root of 1986465012 is about 1257.0724448437.
The spelling of 1986465012 in words is "one billion, nine hundred eighty-six million, four hundred sixty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •