Base | Representation |
---|---|
bin | 11001000010001100011111… |
… | …010000101110011100101011 |
3 | 112102211122112110110011022012 |
4 | 121002030133100232130223 |
5 | 103412402404321024321 |
6 | 1030100055435550135 |
7 | 32122415321615210 |
oct | 3102143720563453 |
9 | 472748473404265 |
10 | 110102011111211 |
11 | 3209a000a11979 |
12 | 104226108bb34b |
13 | 4958762648822 |
14 | 1d28d7410db07 |
15 | cae0152a705b |
hex | 64231f42e72b |
110102011111211 has 32 divisors (see below), whose sum is σ = 135602839756800. Its totient is φ = 87315806730240.
The previous prime is 110102011111207. The next prime is 110102011111217. The reversal of 110102011111211 is 112111110201011.
It is a cyclic number.
It is not a de Polignac number, because 110102011111211 - 22 = 110102011111207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110102011111217) 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, 4995275 + ... + 15657483.
It is an arithmetic number, because the mean of its divisors is an integer number (4237588742400).
Almost surely, 2110102011111211 is an apocalyptic number.
110102011111211 is a deficient number, since it is larger than the sum of its proper divisors (25500828645589).
110102011111211 is a wasteful number, since it uses less digits than its factorization.
110102011111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10664339.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 110102011111211 its reverse (112111110201011), we get a palindrome (222213121312222).
The spelling of 110102011111211 in words is "one hundred ten trillion, one hundred two billion, eleven million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •