Base | Representation |
---|---|
bin | 1010000101101010… |
… | …0011110000000000 |
3 | 20222201202102112000 |
4 | 2201122203300000 |
5 | 21021233001302 |
6 | 1124415504000 |
7 | 124052263434 |
oct | 24132436000 |
9 | 6881672460 |
10 | 2708093952 |
11 | 116a715083 |
12 | 636b28000 |
13 | 34208b875 |
14 | 1b993c9c4 |
15 | 10cb3331c |
hex | a16a3c00 |
2708093952 has 176 divisors, whose sum is σ = 8219114400. Its totient is φ = 880312320.
The previous prime is 2708093903. The next prime is 2708093953. The reversal of 2708093952 is 2593908072.
It is a junction number, because it is equal to n+sod(n) for n = 2708093898 and 2708093907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2708093953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1132374 + ... + 1134762.
Almost surely, 22708093952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2708093952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4109557200).
2708093952 is an abundant number, since it is smaller than the sum of its proper divisors (5511020448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2708093952 is a wasteful number, since it uses less digits than its factorization.
2708093952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2459 (or 2435 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 2708093952 is about 52039.3500343730. The cubic root of 2708093952 is about 1393.8666989310.
The spelling of 2708093952 in words is "two billion, seven hundred eight million, ninety-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •