Base | Representation |
---|---|
bin | 110011101100101001… |
… | …1101100011011111101 |
3 | 101121120011201101201200 |
4 | 1213121103230123331 |
5 | 3304332110013041 |
6 | 123000223530113 |
7 | 11010115303236 |
oct | 1473123543375 |
9 | 347504641650 |
10 | 111020001021 |
11 | 430a0994a66 |
12 | 19624459939 |
13 | a61391aac7 |
14 | 553285a08d |
15 | 2d4b92a1b6 |
hex | 19d94ec6fd |
111020001021 has 24 divisors (see below), whose sum is σ = 163529743104. Its totient is φ = 72565666560.
The previous prime is 111020001019. The next prime is 111020001061. The reversal of 111020001021 is 120100020111.
It is a happy number.
It is not a de Polignac number, because 111020001021 - 21 = 111020001019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 111020000994 and 111020001012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111020001061) 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, 500845 + ... + 687666.
It is an arithmetic number, because the mean of its divisors is an integer number (6813739296).
Almost surely, 2111020001021 is an apocalyptic number.
It is an amenable number.
111020001021 is a deficient number, since it is larger than the sum of its proper divisors (52509742083).
111020001021 is a wasteful number, since it uses less digits than its factorization.
111020001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188721 (or 1188718 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111020001021 its reverse (120100020111), we get a palindrome (231120021132).
The spelling of 111020001021 in words is "one hundred eleven billion, twenty million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •