Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …1011110011111001110111 |
3 | 1022110001101220210102110102 |
4 | 2101223210023303321313 |
5 | 2303010214114213421 |
6 | 33143011541344315 |
7 | 2052164304553106 |
oct | 221534413637167 |
9 | 38401356712412 |
10 | 10011102101111 |
11 | 320a7591689a1 |
12 | 1158275a0809b |
13 | 578073280b17 |
14 | 26877b7ba03d |
15 | 12562994e60b |
hex | 91ae42f3e77 |
10011102101111 has 8 divisors (see below), whose sum is σ = 10232460905040. Its totient is φ = 9791465934208.
The previous prime is 10011102101101. The next prime is 10011102101123. The reversal of 10011102101111 is 11110120111001.
It is a happy number.
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 10011102101111 - 214 = 10011102084727 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011102101092 and 10011102101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011102101101) 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, 430647506 + ... + 430670751.
It is an arithmetic number, because the mean of its divisors is an integer number (1279057613130).
Almost surely, 210011102101111 is an apocalyptic number.
10011102101111 is a deficient number, since it is larger than the sum of its proper divisors (221358803929).
10011102101111 is an equidigital number, since it uses as much as digits as its factorization.
10011102101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861318513.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 10011102101111 its reverse (11110120111001), we get a palindrome (21121222212112).
The spelling of 10011102101111 in words is "ten trillion, eleven billion, one hundred two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •