Base | Representation |
---|---|
bin | 1001100101011111111110… |
… | …0101101111111000100100 |
3 | 1101022121011202211002121201 |
4 | 2121113333211233320210 |
5 | 2340141044233101003 |
6 | 34225534215052244 |
7 | 2135323063100212 |
oct | 231277745577044 |
9 | 41277152732551 |
10 | 10539842862628 |
11 | 33a3a16582962 |
12 | 1222838071084 |
13 | 5b5b9792b051 |
14 | 2861b9ad7cb2 |
15 | 13427386db1d |
hex | 995ff96fe24 |
10539842862628 has 48 divisors (see below), whose sum is σ = 19325207966400. Its totient is φ = 5023301628800.
The previous prime is 10539842862617. The next prime is 10539842862629. The reversal of 10539842862628 is 82626824893501.
It is a super-2 number, since 2×105398428626282 (a number of 27 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (64) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 10539842862628.
It is not an unprimeable number, because it can be changed into a prime (10539842862629) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2769183 + ... + 5361721.
It is an arithmetic number, because the mean of its divisors is an integer number (402608499300).
Almost surely, 210539842862628 is an apocalyptic number.
It is an amenable number.
10539842862628 is a deficient number, since it is larger than the sum of its proper divisors (8785365103772).
10539842862628 is a wasteful number, since it uses less digits than its factorization.
10539842862628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2593020 (or 2593018 counting only the distinct ones).
The product of its (nonzero) digits is 79626240, while the sum is 64.
The spelling of 10539842862628 in words is "ten trillion, five hundred thirty-nine billion, eight hundred forty-two million, eight hundred sixty-two thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •