Base | Representation |
---|---|
bin | 1001010011000100100011… |
… | …1001101111000110011001 |
3 | 1100012022222112120110020021 |
4 | 2110301020321233012121 |
5 | 2314444201241243121 |
6 | 33424254413430441 |
7 | 2103414355626214 |
oct | 224611071570631 |
9 | 40168875513207 |
10 | 10223245259161 |
11 | 329172147a500 |
12 | 119140019b421 |
13 | 5920812a93cc |
14 | 274b4450277b |
15 | 12ade3ec1641 |
hex | 94c48e6f199 |
10223245259161 has 9 divisors (see below), whose sum is σ = 11237159481429. Its totient is φ = 9293827352700.
The previous prime is 10223245259141. The next prime is 10223245259237. The reversal of 10223245259161 is 16195254232201.
The square root of 10223245259161 is 3197381.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 10223245259161 - 27 = 10223245259033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10223245259141) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 35025856 + ... + 35316526.
Almost surely, 210223245259161 is an apocalyptic number.
10223245259161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10223245259161 is the 3197381-st square number.
10223245259161 is the 1598691-st centered octagonal number.
It is an amenable number.
10223245259161 is a deficient number, since it is larger than the sum of its proper divisors (1013914222268).
10223245259161 is an frugal number, since it uses more digits than its factorization.
10223245259161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581364 (or 290682 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 43.
The spelling of 10223245259161 in words is "ten trillion, two hundred twenty-three billion, two hundred forty-five million, two hundred fifty-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •