Base | Representation |
---|---|
bin | 111011000011001… |
… | …1100110111001100 |
3 | 12010002100200100110 |
4 | 1312012130313030 |
5 | 13024214340242 |
6 | 524340200020 |
7 | 100046433612 |
oct | 16606346714 |
9 | 5102320313 |
10 | 1981402572 |
11 | 9274a5096 |
12 | 473699010 |
13 | 257665476 |
14 | 14b2176b2 |
15 | b8e3c39c |
hex | 7619cdcc |
1981402572 has 96 divisors (see below), whose sum is σ = 4924975104. Its totient is φ = 618969600.
The previous prime is 1981402559. The next prime is 1981402589. The reversal of 1981402572 is 2752041891.
It is a super-3 number, since 3×19814025723 (a number of 29 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1981402572.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2485678 + ... + 2486474.
It is an arithmetic number, because the mean of its divisors is an integer number (51301824).
Almost surely, 21981402572 is an apocalyptic number.
1981402572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1981402572 is an abundant number, since it is smaller than the sum of its proper divisors (2943572532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1981402572 is a wasteful number, since it uses less digits than its factorization.
1981402572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1039 (or 1037 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 39.
The square root of 1981402572 is about 44512.9483633695. The cubic root of 1981402572 is about 1256.0036673118.
The spelling of 1981402572 in words is "one billion, nine hundred eighty-one million, four hundred two thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •