Base | Representation |
---|---|
bin | 11001010101000111010010… |
… | …110110010001111100110011 |
3 | 112121102221022011222001201201 |
4 | 121111013102312101330303 |
5 | 104100203002133413021 |
6 | 1032533230430512031 |
7 | 32315351664551461 |
oct | 3125072266217463 |
9 | 477387264861651 |
10 | 111402104201011 |
11 | 32550404635888 |
12 | 105b2583365617 |
13 | 4a21233b07390 |
14 | 1d71c67bab831 |
15 | cd2c57469591 |
hex | 6551d2d91f33 |
111402104201011 has 8 divisors (see below), whose sum is σ = 121661236224864. Its totient is φ = 101384363519040.
The previous prime is 111402104200997. The next prime is 111402104201023. The reversal of 111402104201011 is 110102401204111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111402104201011 - 235 = 111367744462643 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111402104201011.
It is not an unprimeable number, because it can be changed into a prime (111402104211011) 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, 60347834506 + ... + 60347836351.
It is an arithmetic number, because the mean of its divisors is an integer number (15207654528108).
Almost surely, 2111402104201011 is an apocalyptic number.
111402104201011 is a deficient number, since it is larger than the sum of its proper divisors (10259132023853).
111402104201011 is a wasteful number, since it uses less digits than its factorization.
111402104201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120695670941.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 111402104201011 its reverse (110102401204111), we get a palindrome (221504505405122).
The spelling of 111402104201011 in words is "one hundred eleven trillion, four hundred two billion, one hundred four million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •