Base | Representation |
---|---|
bin | 1010111111111110… |
… | …0111011110001110 |
3 | 21121210000011121020 |
4 | 2233333213132032 |
5 | 22021342031200 |
6 | 1204554215010 |
7 | 133112306226 |
oct | 25777473616 |
9 | 7553004536 |
10 | 2952689550 |
11 | 12857973a8 |
12 | 6a4a24466 |
13 | 38095b3a5 |
14 | 20020d086 |
15 | 12434aea0 |
hex | affe778e |
2952689550 has 96 divisors (see below), whose sum is σ = 7634939904. Its totient is φ = 754320000.
The previous prime is 2952689539. The next prime is 2952689573. The reversal of 2952689550 is 559862592.
It is a junction number, because it is equal to n+sod(n) for n = 2952689493 and 2952689502.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 466507 + ... + 472793.
It is an arithmetic number, because the mean of its divisors is an integer number (79530624).
Almost surely, 22952689550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2952689550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3817469952).
2952689550 is an abundant number, since it is smaller than the sum of its proper divisors (4682250354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2952689550 is a wasteful number, since it uses less digits than its factorization.
2952689550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6434 (or 6429 counting only the distinct ones).
The product of its (nonzero) digits is 1944000, while the sum is 51.
The square root of 2952689550 is about 54338.6561298676. The cubic root of 2952689550 is about 1434.6278662895.
The spelling of 2952689550 in words is "two billion, nine hundred fifty-two million, six hundred eighty-nine thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •