Base | Representation |
---|---|
bin | 110011010100111010… |
… | …0100001111000111001 |
3 | 101112111122120220101222 |
4 | 1212221310201320321 |
5 | 3301214131132301 |
6 | 122345203521425 |
7 | 10651302416165 |
oct | 1465164417071 |
9 | 345448526358 |
10 | 110223302201 |
11 | 428221a9391 |
12 | 19441689275 |
13 | a51785269c |
14 | 5498b0dca5 |
15 | 2d01a0631b |
hex | 19a9d21e39 |
110223302201 has 8 divisors (see below), whose sum is σ = 115069092480. Its totient is φ = 105381968032.
The previous prime is 110223302197. The next prime is 110223302251. The reversal of 110223302201 is 102203322011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110223302201 - 22 = 110223302197 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 110223302201.
It is not an unprimeable number, because it can be changed into a prime (110223302251) 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 7 ways as a sum of consecutive naturals, for example, 1063421 + ... + 1162458.
It is an arithmetic number, because the mean of its divisors is an integer number (14383636560).
Almost surely, 2110223302201 is an apocalyptic number.
It is an amenable number.
110223302201 is a deficient number, since it is larger than the sum of its proper divisors (4845790279).
110223302201 is a wasteful number, since it uses less digits than its factorization.
110223302201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228055.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 110223302201 its reverse (102203322011), we get a palindrome (212426624212).
The spelling of 110223302201 in words is "one hundred ten billion, two hundred twenty-three million, three hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •