Base | Representation |
---|---|
bin | 1001100110011100101110… |
… | …10001001001000101001111 |
3 | 2202202022112122010101000010 |
4 | 10303032113101021011033 |
5 | 10231400443320104403 |
6 | 112522505132404303 |
7 | 4306212346003245 |
oct | 463162721110517 |
9 | 82668478111003 |
10 | 21112302113103 |
11 | 67aa74a167753 |
12 | 244b857316693 |
13 | ba1b5c9b1376 |
14 | 52dbab506795 |
15 | 2692a5882603 |
hex | 13339744914f |
21112302113103 has 8 divisors (see below), whose sum is σ = 28149888231808. Its totient is φ = 14074792034904.
The previous prime is 21112302113101. The next prime is 21112302113107. The reversal of 21112302113103 is 30131120321112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21112302113103 - 21 = 21112302113101 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 21112302113103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21112302113101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18359101 + ... + 19475142.
It is an arithmetic number, because the mean of its divisors is an integer number (3518736028976).
Almost surely, 221112302113103 is an apocalyptic number.
21112302113103 is a deficient number, since it is larger than the sum of its proper divisors (7037586118705).
21112302113103 is a wasteful number, since it uses less digits than its factorization.
21112302113103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38020253.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 21112302113103 its reverse (30131120321112), we get a palindrome (51243422434215).
The spelling of 21112302113103 in words is "twenty-one trillion, one hundred twelve billion, three hundred two million, one hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •