Base | Representation |
---|---|
bin | 11001000011101000111110… |
… | …100110011010111100101011 |
3 | 112110012010212112210100000000 |
4 | 121003220332212122330223 |
5 | 103421014301202440021 |
6 | 1030213442114314043 |
7 | 32132532320131653 |
oct | 3103507646327453 |
9 | 473163775710000 |
10 | 110201321140011 |
11 | 32128132928442 |
12 | 10439907588923 |
13 | 4964c2b21a88a |
14 | 1d2dab5687363 |
15 | cb18c8b50b26 |
hex | 643a3e99af2b |
110201321140011 has 18 divisors (see below), whose sum is σ = 165293583509132. Its totient is φ = 73467547422300.
The previous prime is 110201321139983. The next prime is 110201321140039. The reversal of 110201321140011 is 110041123102011.
110201321140011 is a `hidden beast` number, since 1 + 1 + 0 + 201 + 321 + 140 + 0 + 1 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (110201321139983) and next prime (110201321140039).
It is a de Polignac number, because none of the positive numbers 2k-110201321140011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110201321140051) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 8398204165 + ... + 8398217286.
Almost surely, 2110201321140011 is an apocalyptic number.
110201321140011 is a deficient number, since it is larger than the sum of its proper divisors (55092262369121).
110201321140011 is an frugal number, since it uses more digits than its factorization.
110201321140011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16796421475 (or 16796421454 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 110201321140011 its reverse (110041123102011), we get a palindrome (220242444242022).
The spelling of 110201321140011 in words is "one hundred ten trillion, two hundred one billion, three hundred twenty-one million, one hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •