Base | Representation |
---|---|
bin | 1010011110101100… |
… | …0000001011000100 |
3 | 21021001021122210200 |
4 | 2213223000023010 |
5 | 21230121133342 |
6 | 1143045450500 |
7 | 126465453231 |
oct | 24753001304 |
9 | 7231248720 |
10 | 2813067972 |
11 | 12139a3670 |
12 | 666110a30 |
13 | 35aa54380 |
14 | 1c9866788 |
15 | 116e6b94c |
hex | a7ac02c4 |
2813067972 has 144 divisors (see below), whose sum is σ = 8402896320. Its totient is φ = 782265600.
The previous prime is 2813067941. The next prime is 2813067977. The reversal of 2813067972 is 2797603182.
It is not an unprimeable number, because it can be changed into a prime (2813067977) 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 47 ways as a sum of consecutive naturals, for example, 930279 + ... + 933297.
Almost surely, 22813067972 is an apocalyptic number.
2813067972 is a gapful number since it is divisible by the number (22) 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 2813067972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4201448160).
2813067972 is an abundant number, since it is smaller than the sum of its proper divisors (5589828348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2813067972 is a wasteful number, since it uses less digits than its factorization.
2813067972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3234 (or 3229 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The square root of 2813067972 is about 53038.3632100388. The cubic root of 2813067972 is about 1411.6490559688.
The spelling of 2813067972 in words is "two billion, eight hundred thirteen million, sixty-seven thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •