Base | Representation |
---|---|
bin | 111010110011000… |
… | …1011000111110100 |
3 | 12002111102210200000 |
4 | 1311212023013310 |
5 | 13020033110200 |
6 | 523434551300 |
7 | 66614503311 |
oct | 16546130764 |
9 | 5074383600 |
10 | 1972941300 |
11 | 922746000 |
12 | 470898530 |
13 | 2559920b5 |
14 | 14a053d08 |
15 | b831a300 |
hex | 7598b1f4 |
1972941300 has 432 divisors, whose sum is σ = 7169582784. Its totient is φ = 470448000.
The previous prime is 1972941281. The next prime is 1972941331. The reversal of 1972941300 is 31492791.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 143 ways as a sum of consecutive naturals, for example, 32343270 + ... + 32343330.
Almost surely, 21972941300 is an apocalyptic number.
1972941300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1972941300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3584791392).
1972941300 is an abundant number, since it is smaller than the sum of its proper divisors (5196641484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1972941300 is a wasteful number, since it uses less digits than its factorization.
1972941300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123 (or 82 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 36.
The square root of 1972941300 is about 44417.8038628656. The cubic root of 1972941300 is about 1254.2132601290.
The spelling of 1972941300 in words is "one billion, nine hundred seventy-two million, nine hundred forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •