Base | Representation |
---|---|
bin | 11001100000110111110101… |
… | …100110000110000011110011 |
3 | 112201022011222122210010002102 |
4 | 121200313311212012003303 |
5 | 104201422332044342321 |
6 | 1034352343244011015 |
7 | 32430625620251114 |
oct | 3140676546060363 |
9 | 481264878703072 |
10 | 112210141012211 |
11 | 3283206531a800 |
12 | 107030b1230a6b |
13 | 4a7c4a8b15128 |
14 | 1d9cddd66020b |
15 | ce8c9b0c8c0b |
hex | 660df59860f3 |
112210141012211 has 6 divisors (see below), whose sum is σ = 123338419459836. Its totient is φ = 102009219101900.
The previous prime is 112210141012171. The next prime is 112210141012219.
112210141012211 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 112210141012211 - 222 = 112210136817907 is a prime.
It is a super-2 number, since 2×1122101410122112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112210141012219) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 463678268525 + ... + 463678268766.
It is an arithmetic number, because the mean of its divisors is an integer number (20556403243306).
Almost surely, 2112210141012211 is an apocalyptic number.
112210141012211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112210141012211 is a deficient number, since it is larger than the sum of its proper divisors (11128278447625).
112210141012211 is an equidigital number, since it uses as much as digits as its factorization.
112210141012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 927356537313 (or 927356537302 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 20.
The spelling of 112210141012211 in words is "one hundred twelve trillion, two hundred ten billion, one hundred forty-one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •