Base | Representation |
---|---|
bin | 1010000001100100100100… |
… | …0100111001011101001111 |
3 | 1110000200222221110212010102 |
4 | 2200121021010321131033 |
5 | 2421041241144232343 |
6 | 35235253254401315 |
7 | 2215215133020545 |
oct | 240311104713517 |
9 | 43020887425112 |
10 | 11022112102223 |
11 | 356a4a6a32662 |
12 | 12a01ab06023b |
13 | 61c4c4566201 |
14 | 2a168a177d95 |
15 | 141a9ca7d3b8 |
hex | a064913974f |
11022112102223 has 8 divisors (see below), whose sum is σ = 11064028805376. Its totient is φ = 10980247311000.
The previous prime is 11022112102217. The next prime is 11022112102237. The reversal of 11022112102223 is 32220121122011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11022112102223 - 26 = 11022112102159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11022112102195 and 11022112102204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022112102723) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12552503 + ... + 13401848.
It is an arithmetic number, because the mean of its divisors is an integer number (1383003600672).
Almost surely, 211022112102223 is an apocalyptic number.
11022112102223 is a deficient number, since it is larger than the sum of its proper divisors (41916703153).
11022112102223 is a wasteful number, since it uses less digits than its factorization.
11022112102223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25955965.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11022112102223 its reverse (32220121122011), we get a palindrome (43242233224234).
The spelling of 11022112102223 in words is "eleven trillion, twenty-two billion, one hundred twelve million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •