Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …1010011100011000100101 |
3 | 1110100002212001221120012101 |
4 | 2201222333222130120211 |
5 | 2424011240224031041 |
6 | 35343510342452101 |
7 | 2224446116236165 |
oct | 241527752343045 |
9 | 43302761846171 |
10 | 11110001002021 |
11 | 35a37a7a23939 |
12 | 12b5238a34031 |
13 | 62788cbb206c |
14 | 2a5a2693a5a5 |
15 | 143ee38edb31 |
hex | a1abfa9c625 |
11110001002021 has 32 divisors (see below), whose sum is σ = 11960381058048. Its totient is φ = 10294901126400.
The previous prime is 11110001001991. The next prime is 11110001002033. The reversal of 11110001002021 is 12020010001111.
It is not a de Polignac number, because 11110001002021 - 213 = 11110000993829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11110001001989 and 11110001002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110001002091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 438130675 + ... + 438156031.
It is an arithmetic number, because the mean of its divisors is an integer number (373761908064).
Almost surely, 211110001002021 is an apocalyptic number.
It is an amenable number.
11110001002021 is a deficient number, since it is larger than the sum of its proper divisors (850380056027).
11110001002021 is a wasteful number, since it uses less digits than its factorization.
11110001002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29541.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11110001002021 its reverse (12020010001111), we get a palindrome (23130011003132).
The spelling of 11110001002021 in words is "eleven trillion, one hundred ten billion, one million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •