Base | Representation |
---|---|
bin | 1001001001111001011110… |
… | …01011010100100000101111 |
3 | 2122021112102010121211120112 |
4 | 10210330233023110200233 |
5 | 10114312402110304403 |
6 | 110452105405410235 |
7 | 4145303313641225 |
oct | 444745713244057 |
9 | 78245363554515 |
10 | 20131303213103 |
11 | 6461701929495 |
12 | 23116b886997b |
13 | b304b2179b84 |
14 | 4d8508842b15 |
15 | 24d9dc3219d8 |
hex | 124f2f2d482f |
20131303213103 has 4 divisors (see below), whose sum is σ = 20136479689920. Its totient is φ = 20126126736288.
The previous prime is 20131303213061. The next prime is 20131303213159. The reversal of 20131303213103 is 30131230313102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20131303213103 - 218 = 20131302950959 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 (20131303213193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2588232575 + ... + 2588240352.
It is an arithmetic number, because the mean of its divisors is an integer number (5034119922480).
Almost surely, 220131303213103 is an apocalyptic number.
20131303213103 is a deficient number, since it is larger than the sum of its proper divisors (5176476817).
20131303213103 is an equidigital number, since it uses as much as digits as its factorization.
20131303213103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5176476816.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 20131303213103 its reverse (30131230313102), we get a palindrome (50262533526205).
The spelling of 20131303213103 in words is "twenty trillion, one hundred thirty-one billion, three hundred three million, two hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •