Base | Representation |
---|---|
bin | 11001001111101101110111… |
… | …010100011101001011110101 |
3 | 112120010110221022221120102001 |
4 | 121033231313110131023311 |
5 | 104023113400030420041 |
6 | 1032051010233015301 |
7 | 32246511451125661 |
oct | 3117556724351365 |
9 | 476113838846361 |
10 | 111031201420021 |
11 | 32418082695823 |
12 | 10552710854531 |
13 | 49c52748029bc |
14 | 1d5bd201b18a1 |
15 | cc829a2be131 |
hex | 64fb7751d2f5 |
111031201420021 has 32 divisors (see below), whose sum is σ = 119833270560000. Its totient is φ = 102567118123008.
The previous prime is 111031201419989. The next prime is 111031201420039. The reversal of 111031201420021 is 120024102130111.
It is not a de Polignac number, because 111031201420021 - 25 = 111031201419989 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111031201420921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36565561 + ... + 39485473.
It is an arithmetic number, because the mean of its divisors is an integer number (3744789705000).
Almost surely, 2111031201420021 is an apocalyptic number.
It is an amenable number.
111031201420021 is a deficient number, since it is larger than the sum of its proper divisors (8802069139979).
111031201420021 is a wasteful number, since it uses less digits than its factorization.
111031201420021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2920333.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 111031201420021 its reverse (120024102130111), we get a palindrome (231055303550132).
The spelling of 111031201420021 in words is "one hundred eleven trillion, thirty-one billion, two hundred one million, four hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •