Base | Representation |
---|---|
bin | 1010000110101100011001… |
… | …0010101011010000100001 |
3 | 1110100010010211012121121112 |
4 | 2201223012102223100201 |
5 | 2424012002211241001 |
6 | 35343525354233105 |
7 | 2224451636430425 |
oct | 241530622532041 |
9 | 43303124177545 |
10 | 11110112212001 |
11 | 35a3854781610 |
12 | 12b526a125795 |
13 | 6278a9c4c09a |
14 | 2a5a37608b85 |
15 | 143eed569cbb |
hex | a1ac64ab421 |
11110112212001 has 8 divisors (see below), whose sum is σ = 12348803968704. Its totient is φ = 9909534047920.
The previous prime is 11110112211983. The next prime is 11110112212139. The reversal of 11110112212001 is 10021221101111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110112212001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11110112212301) 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, 9528397541 + ... + 9528398706.
It is an arithmetic number, because the mean of its divisors is an integer number (1543600496088).
Almost surely, 211110112212001 is an apocalyptic number.
11110112212001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11110112212001 is a deficient number, since it is larger than the sum of its proper divisors (1238691756703).
11110112212001 is a wasteful number, since it uses less digits than its factorization.
11110112212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19056796311.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11110112212001 its reverse (10021221101111), we get a palindrome (21131333313112).
The spelling of 11110112212001 in words is "eleven trillion, one hundred ten billion, one hundred twelve million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •