Base | Representation |
---|---|
bin | 110011010111010010… |
… | …0101010111110110101 |
3 | 101112201012121120001122 |
4 | 1212232210222332311 |
5 | 3301400033444341 |
6 | 122401132433325 |
7 | 10653261203255 |
oct | 1465644527665 |
9 | 345635546048 |
10 | 110303031221 |
11 | 42863204a39 |
12 | 19464318845 |
13 | a52b219616 |
14 | 54a5545965 |
15 | 2d08a0494b |
hex | 19ae92afb5 |
110303031221 has 4 divisors (see below), whose sum is σ = 110797663872. Its totient is φ = 109808398572.
The previous prime is 110303031197. The next prime is 110303031283. The reversal of 110303031221 is 122130303011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110303031221 - 214 = 110303014837 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110303031221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110303030221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 247315991 + ... + 247316436.
It is an arithmetic number, because the mean of its divisors is an integer number (27699415968).
Almost surely, 2110303031221 is an apocalyptic number.
It is an amenable number.
110303031221 is a deficient number, since it is larger than the sum of its proper divisors (494632651).
110303031221 is an equidigital number, since it uses as much as digits as its factorization.
110303031221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494632650.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 110303031221 its reverse (122130303011), we get a palindrome (232433334232).
The spelling of 110303031221 in words is "one hundred ten billion, three hundred three million, thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •