Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0111010001111011010101 |
3 | 1110100012110110102202222201 |
4 | 2201223323313101323111 |
5 | 2424020322304000041 |
6 | 35344154502324501 |
7 | 2224513132130602 |
oct | 241537367217325 |
9 | 43305413382881 |
10 | 11111011000021 |
11 | 35a4176056329 |
12 | 12b547b129731 |
13 | 6279c120cc0a |
14 | 2a5ac0b2b6a9 |
15 | 144052407631 |
hex | a1afbdd1ed5 |
11111011000021 has 8 divisors (see below), whose sum is σ = 11116611004544. Its totient is φ = 11105411927760.
The previous prime is 11111010999997. The next prime is 11111011000031. The reversal of 11111011000021 is 12000011011111.
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 11111011000021 - 29 = 11111010999509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11111010999971 and 11111011000007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111011000031) 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, 24254920 + ... + 24708766.
It is an arithmetic number, because the mean of its divisors is an integer number (1389576375568).
Almost surely, 211111011000021 is an apocalyptic number.
It is an amenable number.
11111011000021 is a deficient number, since it is larger than the sum of its proper divisors (5600004523).
11111011000021 is an equidigital number, since it uses as much as digits as its factorization.
11111011000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466131.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11111011000021 its reverse (12000011011111), we get a palindrome (23111022011132).
The spelling of 11111011000021 in words is "eleven trillion, one hundred eleven billion, eleven million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •