Base | Representation |
---|---|
bin | 1001010100001111000110… |
… | …1001010001101011101101 |
3 | 1100021020122010121200210212 |
4 | 2111003301221101223231 |
5 | 2320311142034204203 |
6 | 33441404212512205 |
7 | 2105023302535664 |
oct | 225036151215355 |
9 | 40236563550725 |
10 | 10243256163053 |
11 | 329a160076801 |
12 | 119526591b665 |
13 | 593c20001144 |
14 | 275ac2025ddb |
15 | 12b6b5b931d8 |
hex | 950f1a51aed |
10243256163053 has 32 divisors (see below), whose sum is σ = 11245242286080. Its totient is φ = 9301469950080.
The previous prime is 10243256163047. The next prime is 10243256163073. The reversal of 10243256163053 is 35036165234201.
10243256163053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10243256163053 - 224 = 10243239385837 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10243256163053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10243256163013) 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, 7423526 + ... + 8694552.
It is an arithmetic number, because the mean of its divisors is an integer number (351413821440).
Almost surely, 210243256163053 is an apocalyptic number.
It is an amenable number.
10243256163053 is a deficient number, since it is larger than the sum of its proper divisors (1001986123027).
10243256163053 is a wasteful number, since it uses less digits than its factorization.
10243256163053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1271297.
The product of its (nonzero) digits is 388800, while the sum is 41.
The spelling of 10243256163053 in words is "ten trillion, two hundred forty-three billion, two hundred fifty-six million, one hundred sixty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •