Base | Representation |
---|---|
bin | 1010000110001110010000… |
… | …0110001100110000010111 |
3 | 1110022100021000122200111020 |
4 | 2201203210012030300113 |
5 | 2423343420203320343 |
6 | 35340110524012223 |
7 | 2224044314500026 |
oct | 241434406146027 |
9 | 43270230580436 |
10 | 11102022323223 |
11 | 35a0383199417 |
12 | 12b3790991073 |
13 | 626bbabc5850 |
14 | 2a54ab0228bd |
15 | 143bc8215b83 |
hex | a18e418cc17 |
11102022323223 has 16 divisors (see below), whose sum is σ = 15941446770816. Its totient is φ = 6831978858720.
The previous prime is 11102022323221. The next prime is 11102022323233. The reversal of 11102022323223 is 32232322020111.
It is not a de Polignac number, because 11102022323223 - 21 = 11102022323221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102022323193 and 11102022323202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102022323221) 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, 8490568 + ... + 9710498.
It is an arithmetic number, because the mean of its divisors is an integer number (996340423176).
Almost surely, 211102022323223 is an apocalyptic number.
11102022323223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11102022323223 is a deficient number, since it is larger than the sum of its proper divisors (4839424447593).
11102022323223 is a wasteful number, since it uses less digits than its factorization.
11102022323223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1453294.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 11102022323223 its reverse (32232322020111), we get a palindrome (43334344343334).
The spelling of 11102022323223 in words is "eleven trillion, one hundred two billion, twenty-two million, three hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •