Base | Representation |
---|---|
bin | 11001001111010000110011… |
… | …101000011000100100010110 |
3 | 112120000111101220220010211111 |
4 | 121033100303220120210112 |
5 | 104022111000230202410 |
6 | 1032024410240125234 |
7 | 32244325334124055 |
oct | 3117206350304426 |
9 | 476014356803744 |
10 | 111000001022230 |
11 | 324059218a4101 |
12 | 1054866390681a |
13 | 49c2341837368 |
14 | 1d5a60057239c |
15 | cc75710cbb8a |
hex | 64f433a18916 |
111000001022230 has 64 divisors (see below), whose sum is σ = 204656113525248. Its totient is φ = 43323002150400.
The previous prime is 111000001022171. The next prime is 111000001022233. The reversal of 111000001022230 is 32220100000111.
It is a super-2 number, since 2×1110000010222302 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111000001022230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111000001022233) 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, 1968022030 + ... + 1968078430.
It is an arithmetic number, because the mean of its divisors is an integer number (3197751773832).
Almost surely, 2111000001022230 is an apocalyptic number.
111000001022230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111000001022230 is a deficient number, since it is larger than the sum of its proper divisors (93656112503018).
111000001022230 is a wasteful number, since it uses less digits than its factorization.
111000001022230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61061.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 111000001022230 its reverse (32220100000111), we get a palindrome (143220101022341).
The spelling of 111000001022230 in words is "one hundred eleven trillion, one million, twenty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •