Base | Representation |
---|---|
bin | 1001001100110001111001… |
… | …00000100001010010110111 |
3 | 2122121222222011110201211010 |
4 | 10212120330200201102313 |
5 | 10122423134121401403 |
6 | 111005402052443303 |
7 | 4155406653166155 |
oct | 446307440412267 |
9 | 78558864421733 |
10 | 20230311122103 |
11 | 649a699252975 |
12 | 232892a319533 |
13 | b3993028b304 |
14 | 4dd21bc143d5 |
15 | 2513843dd603 |
hex | 12663c8214b7 |
20230311122103 has 4 divisors (see below), whose sum is σ = 26973748162808. Its totient is φ = 13486874081400.
The previous prime is 20230311122081. The next prime is 20230311122113. The reversal of 20230311122103 is 30122111303202.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 20230311122103 - 26 = 20230311122039 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 20230311122103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20230311122113) 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, 3371718520348 + ... + 3371718520353.
It is an arithmetic number, because the mean of its divisors is an integer number (6743437040702).
Almost surely, 220230311122103 is an apocalyptic number.
20230311122103 is a deficient number, since it is larger than the sum of its proper divisors (6743437040705).
20230311122103 is an equidigital number, since it uses as much as digits as its factorization.
20230311122103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6743437040704.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20230311122103 its reverse (30122111303202), we get a palindrome (50352422425305).
The spelling of 20230311122103 in words is "twenty trillion, two hundred thirty billion, three hundred eleven million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •