Base | Representation |
---|---|
bin | 1001001001101010100101… |
… | …10111101001101011010111 |
3 | 2122020202210012221100002110 |
4 | 10210311102313221223113 |
5 | 10114200020344231403 |
6 | 110444304424242103 |
7 | 4144601301422430 |
oct | 444652267515327 |
9 | 78222705840073 |
10 | 20123312102103 |
11 | 6459281082521 |
12 | 2310048610333 |
13 | b2c80a729a22 |
14 | 4d7d8b410487 |
15 | 24d6c09d0103 |
hex | 124d52de9ad7 |
20123312102103 has 16 divisors (see below), whose sum is σ = 30664847269376. Its totient is φ = 11498753247840.
The previous prime is 20123312102087. The next prime is 20123312102111. The reversal of 20123312102103 is 30120121332102.
It is not a de Polignac number, because 20123312102103 - 24 = 20123312102087 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 20123312102103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20123312102303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10882483 + ... + 12596628.
It is an arithmetic number, because the mean of its divisors is an integer number (1916552954336).
Almost surely, 220123312102103 is an apocalyptic number.
20123312102103 is a deficient number, since it is larger than the sum of its proper divisors (10541535167273).
20123312102103 is a wasteful number, since it uses less digits than its factorization.
20123312102103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23519934.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20123312102103 its reverse (30120121332102), we get a palindrome (50243433434205).
The spelling of 20123312102103 in words is "twenty trillion, one hundred twenty-three billion, three hundred twelve million, one hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •