Base | Representation |
---|---|
bin | 1010000110101100000001… |
… | …0001000000011001101101 |
3 | 1110100002212202222011010210 |
4 | 2201223000101000121231 |
5 | 2424011300321023041 |
6 | 35343511343253033 |
7 | 2224446301201404 |
oct | 241530021003155 |
9 | 43302782864123 |
10 | 11110011111021 |
11 | 35a38026a8989 |
12 | 12b52402aa179 |
13 | 627892011414 |
14 | 2a5a2800c63b |
15 | 143ee4749016 |
hex | a1ac044066d |
11110011111021 has 8 divisors (see below), whose sum is σ = 14821827461344. Its totient is φ = 7402434417360.
The previous prime is 11110011111011. The next prime is 11110011111079. The reversal of 11110011111021 is 12011111001111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11110011111021 - 29 = 11110011110509 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11110011110988 and 11110011111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110011111011) 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, 1059908050 + ... + 1059918531.
It is an arithmetic number, because the mean of its divisors is an integer number (1852728432668).
Almost surely, 211110011111021 is an apocalyptic number.
It is an amenable number.
11110011111021 is a deficient number, since it is larger than the sum of its proper divisors (3711816350323).
11110011111021 is a wasteful number, since it uses less digits than its factorization.
11110011111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2119828331.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 11110011111021 its reverse (12011111001111), we get a palindrome (23121122112132).
The spelling of 11110011111021 in words is "eleven trillion, one hundred ten billion, eleven million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •