Base | Representation |
---|---|
bin | 1010010001101111110111… |
… | …0011000010001000101111 |
3 | 1111000021022221222112102200 |
4 | 2210123331303002020233 |
5 | 2440114421113032343 |
6 | 40011054120152543 |
7 | 2244254036134263 |
oct | 244337563021057 |
9 | 44007287875380 |
10 | 11300022002223 |
11 | 3667348913869 |
12 | 132602a608753 |
13 | 63c783987516 |
14 | 2b0cd15a40a3 |
15 | 148e15c624d3 |
hex | a46fdcc222f |
11300022002223 has 24 divisors (see below), whose sum is σ = 17184244022400. Its totient is φ = 7135641409104.
The previous prime is 11300022002167. The next prime is 11300022002267. The reversal of 11300022002223 is 32220022000311.
It is not a de Polignac number, because 11300022002223 - 218 = 11300021740079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11300022002196 and 11300022002205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11300022003223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4614865 + ... + 6625482.
It is an arithmetic number, because the mean of its divisors is an integer number (716010167600).
Almost surely, 211300022002223 is an apocalyptic number.
11300022002223 is a deficient number, since it is larger than the sum of its proper divisors (5884222020177).
11300022002223 is a wasteful number, since it uses less digits than its factorization.
11300022002223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11246251 (or 11246248 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 11300022002223 its reverse (32220022000311), we get a palindrome (43520044002534).
The spelling of 11300022002223 in words is "eleven trillion, three hundred billion, twenty-two million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •