Base | Representation |
---|---|
bin | 111010100000000… |
… | …1001011010110100 |
3 | 12001210200100112020 |
4 | 1311000021122310 |
5 | 13010010112402 |
6 | 522441153140 |
7 | 66433664631 |
oct | 16500113264 |
9 | 5053610466 |
10 | 1962972852 |
11 | 918057615 |
12 | 46948b7b0 |
13 | 2538b19c9 |
14 | 1489bb188 |
15 | b74eb8bc |
hex | 750096b4 |
1962972852 has 48 divisors (see below), whose sum is σ = 4606127232. Its totient is φ = 650643840.
The previous prime is 1962972841. The next prime is 1962972857. The reversal of 1962972852 is 2582792691.
It is a junction number, because it is equal to n+sod(n) for n = 1962972795 and 1962972804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1962972857) 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, 3005758 + ... + 3006410.
It is an arithmetic number, because the mean of its divisors is an integer number (95960984).
Almost surely, 21962972852 is an apocalyptic number.
1962972852 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1962972852 is an abundant number, since it is smaller than the sum of its proper divisors (2643154380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1962972852 is a wasteful number, since it uses less digits than its factorization.
1962972852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1688 (or 1686 counting only the distinct ones).
The product of its digits is 1088640, while the sum is 51.
The square root of 1962972852 is about 44305.4494616633. The cubic root of 1962972852 is about 1252.0973540100.
The spelling of 1962972852 in words is "one billion, nine hundred sixty-two million, nine hundred seventy-two thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •