Base | Representation |
---|---|
bin | 1010001001101010… |
… | …1111111011101010 |
3 | 21000220102022222110 |
4 | 2202122233323222 |
5 | 21040034433231 |
6 | 1130220303150 |
7 | 124345306200 |
oct | 24232577352 |
9 | 7026368873 |
10 | 2724921066 |
11 | 117916858a |
12 | 6406a1ab6 |
13 | 345700a3a |
14 | 1bbc7d070 |
15 | 10e359046 |
hex | a26afeea |
2724921066 has 48 divisors (see below), whose sum is σ = 6372592704. Its totient is φ = 774498816.
The previous prime is 2724921053. The next prime is 2724921079. The reversal of 2724921066 is 6601294272.
It is an interprime number because it is at equal distance from previous prime (2724921053) and next prime (2724921079).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32731 + ... + 80753.
It is an arithmetic number, because the mean of its divisors is an integer number (132762348).
Almost surely, 22724921066 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2724921066, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3186296352).
2724921066 is an abundant number, since it is smaller than the sum of its proper divisors (3647671638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2724921066 is a wasteful number, since it uses less digits than its factorization.
2724921066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48235 (or 48228 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 39.
The square root of 2724921066 is about 52200.7764884776. The cubic root of 2724921066 is about 1396.7477340165.
The spelling of 2724921066 in words is "two billion, seven hundred twenty-four million, nine hundred twenty-one thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •