Base | Representation |
---|---|
bin | 1100111011011101100… |
… | …1000011111000000111 |
3 | 210020022221012211020101 |
4 | 3032313121003320013 |
5 | 12114400223211403 |
6 | 250012433144531 |
7 | 22022225654032 |
oct | 3166731037007 |
9 | 706287184211 |
10 | 222120132103 |
11 | 86223029911 |
12 | 3706b6bb147 |
13 | 17c3b01323c |
14 | aa71bb4019 |
15 | 5ba03d271d |
hex | 33b7643e07 |
222120132103 has 4 divisors (see below), whose sum is σ = 222121084360. Its totient is φ = 222119179848.
The previous prime is 222120132097. The next prime is 222120132109. The reversal of 222120132103 is 301231021222.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is an interprime number because it is at equal distance from previous prime (222120132097) and next prime (222120132109).
It is a cyclic number.
It is not a de Polignac number, because 222120132103 - 229 = 221583261191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222120132109) 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, 136576 + ... + 680362.
It is an arithmetic number, because the mean of its divisors is an integer number (55530271090).
Almost surely, 2222120132103 is an apocalyptic number.
222120132103 is a deficient number, since it is larger than the sum of its proper divisors (952257).
222120132103 is an equidigital number, since it uses as much as digits as its factorization.
222120132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 952256.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 222120132103 its reverse (301231021222), we get a palindrome (523351153325).
The spelling of 222120132103 in words is "two hundred twenty-two billion, one hundred twenty million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •