Base | Representation |
---|---|
bin | 110011110010010100… |
… | …0100100010010000101 |
3 | 101122001102021110112111 |
4 | 1213210220210102011 |
5 | 3310224231201041 |
6 | 123031132421021 |
7 | 11014613406310 |
oct | 1474450442205 |
9 | 348042243474 |
10 | 111210022021 |
11 | 4318918160a |
12 | 19678017771 |
13 | a6440bcc77 |
14 | 554dba1977 |
15 | 2d5d462981 |
hex | 19e4a24485 |
111210022021 has 8 divisors (see below), whose sum is σ = 127112671424. Its totient is φ = 95311248480.
The previous prime is 111210021959. The next prime is 111210022037. The reversal of 111210022021 is 120220012111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-111210022021 is a prime.
It is a super-2 number, since 2×1112100220212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111210021992 and 111210022010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111210022061) 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, 907215 + ... + 1022476.
It is an arithmetic number, because the mean of its divisors is an integer number (15889083928).
Almost surely, 2111210022021 is an apocalyptic number.
It is an amenable number.
111210022021 is a deficient number, since it is larger than the sum of its proper divisors (15902649403).
111210022021 is an equidigital number, since it uses as much as digits as its factorization.
111210022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1937931.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 111210022021 its reverse (120220012111), we get a palindrome (231430034132).
The spelling of 111210022021 in words is "one hundred eleven billion, two hundred ten million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •