Base | Representation |
---|---|
bin | 1001100110001011111111… |
… | …11001100011101111101111 |
3 | 2202201110100122220212020010 |
4 | 10303011333321203233233 |
5 | 10231224044422322203 |
6 | 112514421553224303 |
7 | 4305443642221311 |
oct | 463057771435757 |
9 | 82643318825203 |
10 | 21103320120303 |
11 | 67a6960055603 |
12 | 2449b6b262093 |
13 | ba105ab97425 |
14 | 52d59865b7b1 |
15 | 268e2c061303 |
hex | 13317fe63bef |
21103320120303 has 4 divisors (see below), whose sum is σ = 28137760160408. Its totient is φ = 14068880080200.
The previous prime is 21103320120299. The next prime is 21103320120313. The reversal of 21103320120303 is 30302102330112.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 21103320120303 - 22 = 21103320120299 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 21103320120303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21103320120313) 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, 3517220020048 + ... + 3517220020053.
It is an arithmetic number, because the mean of its divisors is an integer number (7034440040102).
Almost surely, 221103320120303 is an apocalyptic number.
21103320120303 is a deficient number, since it is larger than the sum of its proper divisors (7034440040105).
21103320120303 is an equidigital number, since it uses as much as digits as its factorization.
21103320120303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7034440040104.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21103320120303 its reverse (30302102330112), we get a palindrome (51405422450415).
The spelling of 21103320120303 in words is "twenty-one trillion, one hundred three billion, three hundred twenty million, one hundred twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •