Base | Representation |
---|---|
bin | 1001100101101011001101… |
… | …0000101100111011000001 |
3 | 1101022212221211220112222022 |
4 | 2121122303100230323001 |
5 | 2340213232423304403 |
6 | 34231153255451225 |
7 | 2135460554652140 |
oct | 231326320547301 |
9 | 41285854815868 |
10 | 10542857244353 |
11 | 33a5223076525 |
12 | 1223339686b15 |
13 | 5b62582a9685 |
14 | 2863c41a5757 |
15 | 13439d303d38 |
hex | 996b342cec1 |
10542857244353 has 32 divisors (see below), whose sum is σ = 12912820454400. Its totient is φ = 8406411626304.
The previous prime is 10542857244343. The next prime is 10542857244431. The reversal of 10542857244353 is 35344275824501.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10542857244353 - 28 = 10542857244097 is a prime.
It is a super-2 number, since 2×105428572443532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10542857244295 and 10542857244304.
It is not an unprimeable number, because it can be changed into a prime (10542857244323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6115826 + ... + 7647812.
It is an arithmetic number, because the mean of its divisors is an integer number (403525639200).
Almost surely, 210542857244353 is an apocalyptic number.
It is an amenable number.
10542857244353 is a deficient number, since it is larger than the sum of its proper divisors (2369963210047).
10542857244353 is a wasteful number, since it uses less digits than its factorization.
10542857244353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1532949.
The product of its (nonzero) digits is 16128000, while the sum is 53.
The spelling of 10542857244353 in words is "ten trillion, five hundred forty-two billion, eight hundred fifty-seven million, two hundred forty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •