Base | Representation |
---|---|
bin | 1010001101110010… |
… | …1001000101000100 |
3 | 21002002220220200021 |
4 | 2203130221011010 |
5 | 21104000211000 |
6 | 1132034424524 |
7 | 124645161103 |
oct | 24334510504 |
9 | 7062826607 |
10 | 2742194500 |
11 | 1187996351 |
12 | 646432144 |
13 | 34916b0c6 |
14 | 1c029803a |
15 | 110b1c11a |
hex | a3729144 |
2742194500 has 24 divisors (see below), whose sum is σ = 5988953880. Its totient is φ = 1096877600.
The previous prime is 2742194479. The next prime is 2742194501. The reversal of 2742194500 is 54912472.
It can be written as a sum of positive squares in 4 ways, for example, as 328044544 + 2414149956 = 18112^2 + 49134^2 .
It is not an unprimeable number, because it can be changed into a prime (2742194501) 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 7 ways as a sum of consecutive naturals, for example, 2741695 + ... + 2742694.
It is an arithmetic number, because the mean of its divisors is an integer number (249539745).
Almost surely, 22742194500 is an apocalyptic number.
2742194500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2742194500 is an abundant number, since it is smaller than the sum of its proper divisors (3246759380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2742194500 is a wasteful number, since it uses less digits than its factorization.
2742194500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5484408 (or 5484396 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 34.
The square root of 2742194500 is about 52365.9670014791. The cubic root of 2742194500 is about 1399.6928748062.
The spelling of 2742194500 in words is "two billion, seven hundred forty-two million, one hundred ninety-four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •