Base | Representation |
---|---|
bin | 101001000101101000011… |
… | …110010010100001100010 |
3 | 100222221001210110202111010 |
4 | 221011220132102201202 |
5 | 332230110322043010 |
6 | 10001041432001350 |
7 | 410665052263545 |
oct | 51055036224142 |
9 | 10887053422433 |
10 | 2823546284130 |
11 | 9995062a4330 |
12 | 39727bb30256 |
13 | 17634a80bc40 |
14 | 9a9360a685c |
15 | 4d6a853b620 |
hex | 29168792862 |
2823546284130 has 512 divisors, whose sum is σ = 8741169561600. Its totient is φ = 572789145600.
The previous prime is 2823546284129. The next prime is 2823546284201. The reversal of 2823546284130 is 314826453282.
It is a self number, because there is not a number n which added to its sum of digits gives 2823546284130.
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 255 ways as a sum of consecutive naturals, for example, 1038448911 + ... + 1038451629.
It is an arithmetic number, because the mean of its divisors is an integer number (17072596800).
Almost surely, 22823546284130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2823546284130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4370584780800).
2823546284130 is an abundant number, since it is smaller than the sum of its proper divisors (5917623277470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2823546284130 is a wasteful number, since it uses less digits than its factorization.
2823546284130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3290.
The product of its (nonzero) digits is 2211840, while the sum is 48.
The spelling of 2823546284130 in words is "two trillion, eight hundred twenty-three billion, five hundred forty-six million, two hundred eighty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •