Base | Representation |
---|---|
bin | 1010000111001000… |
… | …0000111110100100 |
3 | 21000011022211101210 |
4 | 2201302000332210 |
5 | 21024321233410 |
6 | 1125155351420 |
7 | 124155453561 |
oct | 24162007644 |
9 | 7004284353 |
10 | 2714242980 |
11 | 1173134a19 |
12 | 638bb2570 |
13 | 343432647 |
14 | 1ba69d868 |
15 | 10d44a220 |
hex | a1c80fa4 |
2714242980 has 48 divisors (see below), whose sum is σ = 7606872000. Its totient is φ = 723132288.
The previous prime is 2714242957. The next prime is 2714242987. The reversal of 2714242980 is 892424172.
It is a happy number.
It is a super-2 number, since 2×27142429802 = 14734229908958560800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2714242987) 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, 46771 + ... + 87269.
It is an arithmetic number, because the mean of its divisors is an integer number (158476500).
Almost surely, 22714242980 is an apocalyptic number.
2714242980 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2714242980 is an abundant number, since it is smaller than the sum of its proper divisors (4892629020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2714242980 is a wasteful number, since it uses less digits than its factorization.
2714242980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41628 (or 41626 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 39.
The square root of 2714242980 is about 52098.3970962639. The cubic root of 2714242980 is about 1394.9208778238.
The spelling of 2714242980 in words is "two billion, seven hundred fourteen million, two hundred forty-two thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •