Base | Representation |
---|---|
bin | 110011101111000010… |
… | …0111100110011110001 |
3 | 101121202202021212212200 |
4 | 1213132010330303301 |
5 | 3310013101201001 |
6 | 123012203013413 |
7 | 11012106414453 |
oct | 1473604746361 |
9 | 347682255780 |
10 | 111100022001 |
11 | 4313207aa01 |
12 | 1964720a269 |
13 | a6273878b7 |
14 | 553d32a2d3 |
15 | 2d53985086 |
hex | 19de13ccf1 |
111100022001 has 48 divisors (see below), whose sum is σ = 171263389440. Its totient is φ = 69203328480.
The previous prime is 111100021999. The next prime is 111100022009. The reversal of 111100022001 is 100220001111.
It is a happy number.
It is not a de Polignac number, because 111100022001 - 21 = 111100021999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (111100022009) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3636150 + ... + 3666576.
It is an arithmetic number, because the mean of its divisors is an integer number (3567987280).
Almost surely, 2111100022001 is an apocalyptic number.
It is an amenable number.
111100022001 is a deficient number, since it is larger than the sum of its proper divisors (60163367439).
111100022001 is a wasteful number, since it uses less digits than its factorization.
111100022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30746 (or 30743 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111100022001 its reverse (100220001111), we get a palindrome (211320023112).
The spelling of 111100022001 in words is "one hundred eleven billion, one hundred million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •