Base | Representation |
---|---|
bin | 110011001110010010… |
… | …1010110111000001011 |
3 | 101111221011201000110011 |
4 | 1212130211112320023 |
5 | 3300240303034011 |
6 | 122311151532351 |
7 | 10642634644414 |
oct | 1463445267013 |
9 | 344834630404 |
10 | 110001221131 |
11 | 4271890460a |
12 | 1939b22a0b7 |
13 | a4b0836979 |
14 | 547742080b |
15 | 2cdc289621 |
hex | 199c956e0b |
110001221131 has 4 divisors (see below), whose sum is σ = 110291462200. Its totient is φ = 109710980064.
The previous prime is 110001221129. The next prime is 110001221137. The reversal of 110001221131 is 131122100011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110001221131 - 21 = 110001221129 is a prime.
It is a super-2 number, since 2×1100012211312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110001221137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145119966 + ... + 145120723.
It is an arithmetic number, because the mean of its divisors is an integer number (27572865550).
Almost surely, 2110001221131 is an apocalyptic number.
110001221131 is a deficient number, since it is larger than the sum of its proper divisors (290241069).
110001221131 is an equidigital number, since it uses as much as digits as its factorization.
110001221131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290241068.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110001221131 its reverse (131122100011), we get a palindrome (241123321142).
The spelling of 110001221131 in words is "one hundred ten billion, one million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •