Base | Representation |
---|---|
bin | 1010000011111011100101… |
… | …11000110010101101100111 |
3 | 2220100011021110221201022201 |
4 | 11001331302320302231213 |
5 | 10400000110313011403 |
6 | 115020120243235331 |
7 | 4442333442151546 |
oct | 501756270625547 |
9 | 86304243851281 |
10 | 22125304032103 |
11 | 706031a358848 |
12 | 2594047678b47 |
13 | c4653a8711ac |
14 | 566c2865815d |
15 | 2857e37c921d |
hex | 141f72e32b67 |
22125304032103 has 4 divisors (see below), whose sum is σ = 22125314080368. Its totient is φ = 22125293983840.
The previous prime is 22125304032061. The next prime is 22125304032173. The reversal of 22125304032103 is 30123040352122.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 22125304032103 - 221 = 22125301934951 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 (22125304032173) 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, 136018 + ... + 6653503.
It is an arithmetic number, because the mean of its divisors is an integer number (5531328520092).
Almost surely, 222125304032103 is an apocalyptic number.
22125304032103 is a deficient number, since it is larger than the sum of its proper divisors (10048265).
22125304032103 is an equidigital number, since it uses as much as digits as its factorization.
22125304032103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10048264.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 22125304032103 its reverse (30123040352122), we get a palindrome (52248344384225).
The spelling of 22125304032103 in words is "twenty-two trillion, one hundred twenty-five billion, three hundred four million, thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •