Base | Representation |
---|---|
bin | 1001100000111010… |
… | …0000111111110110 |
3 | 20120222200200210200 |
4 | 2120032200333312 |
5 | 20212302121011 |
6 | 1101231501330 |
7 | 120201102030 |
oct | 23016407766 |
9 | 6528620720 |
10 | 2553942006 |
11 | 10a06a7480 |
12 | 5b3387846 |
13 | 319167bb5 |
14 | 1a3292c50 |
15 | ee333856 |
hex | 983a0ff6 |
2553942006 has 96 divisors (see below), whose sum is σ = 7121627136. Its totient is φ = 641952000.
The previous prime is 2553941989. The next prime is 2553942073. The reversal of 2553942006 is 6002493552.
It is a super-2 number, since 2×25539420062 = 13045239540022608072, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13246 + ... + 72686.
It is an arithmetic number, because the mean of its divisors is an integer number (74183616).
Almost surely, 22553942006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2553942006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3560813568).
2553942006 is an abundant number, since it is smaller than the sum of its proper divisors (4567685130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2553942006 is a wasteful number, since it uses less digits than its factorization.
2553942006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59498 (or 59495 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The square root of 2553942006 is about 50536.5412943941. The cubic root of 2553942006 is about 1366.9008400501.
The spelling of 2553942006 in words is "two billion, five hundred fifty-three million, nine hundred forty-two thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •