Base | Representation |
---|---|
bin | 1001000110011101100100… |
… | …01000111100100000100011 |
3 | 2121212020200012100022222211 |
4 | 10203032302020330200203 |
5 | 10110344104234242012 |
6 | 110321542305342551 |
7 | 4133623530264520 |
oct | 443166210744043 |
9 | 77766605308884 |
10 | 20013241321507 |
11 | 6416627a88955 |
12 | 22b284a037a57 |
13 | b22318679c15 |
14 | 4d2908a84147 |
15 | 24a8cc5a56a7 |
hex | 1233b223c823 |
20013241321507 has 4 divisors (see below), whose sum is σ = 22872275796016. Its totient is φ = 17154206847000.
The previous prime is 20013241321487. The next prime is 20013241321523. The reversal of 20013241321507 is 70512314231002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20013241321507 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20013241325507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1429517237244 + ... + 1429517237257.
It is an arithmetic number, because the mean of its divisors is an integer number (5718068949004).
Almost surely, 220013241321507 is an apocalyptic number.
20013241321507 is a deficient number, since it is larger than the sum of its proper divisors (2859034474509).
20013241321507 is an equidigital number, since it uses as much as digits as its factorization.
20013241321507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2859034474508.
The product of its (nonzero) digits is 10080, while the sum is 31.
Adding to 20013241321507 its reverse (70512314231002), we get a palindrome (90525555552509).
The spelling of 20013241321507 in words is "twenty trillion, thirteen billion, two hundred forty-one million, three hundred twenty-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •