Base | Representation |
---|---|
bin | 11001000000110111111011… |
… | …001001110101000010011001 |
3 | 112102111222011110001002221010 |
4 | 121000313323021311002121 |
5 | 103404410430004311301 |
6 | 1025550241434404133 |
7 | 32113022235524514 |
oct | 3100677311650231 |
9 | 472458143032833 |
10 | 110011211010201 |
11 | 320645466a1086 |
12 | 10408aabb90649 |
13 | 4950021b396c7 |
14 | 1d247dcc5bd7b |
15 | cab99da835d6 |
hex | 640dfb275099 |
110011211010201 has 16 divisors (see below), whose sum is σ = 154402189491200. Its totient is φ = 69480544426128.
The previous prime is 110011211010199. The next prime is 110011211010241. The reversal of 110011211010201 is 102010112110011.
It is not a de Polignac number, because 110011211010201 - 21 = 110011211010199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110011211010241) 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 15 ways as a sum of consecutive naturals, for example, 16107180 + ... + 21896658.
It is an arithmetic number, because the mean of its divisors is an integer number (9650136843200).
Almost surely, 2110011211010201 is an apocalyptic number.
It is an amenable number.
110011211010201 is a deficient number, since it is larger than the sum of its proper divisors (44390978480999).
110011211010201 is a wasteful number, since it uses less digits than its factorization.
110011211010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6122868.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110011211010201 its reverse (102010112110011), we get a palindrome (212021323120212).
The spelling of 110011211010201 in words is "one hundred ten trillion, eleven billion, two hundred eleven million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •