Base | Representation |
---|---|
bin | 1001001001111001011110… |
… | …00000010010101100110101 |
3 | 2122021112101221011221212101 |
4 | 10210330233000102230311 |
5 | 10114312400340301401 |
6 | 110452105223422101 |
7 | 4145303250240523 |
oct | 444745700225465 |
9 | 78245357157771 |
10 | 20131300322101 |
11 | 6461700234431 |
12 | 23116b78b4931 |
13 | b304b16a7017 |
14 | 4d85082cd313 |
15 | 24d9dbe50101 |
hex | 124f2f012b35 |
20131300322101 has 4 divisors (see below), whose sum is σ = 20132025985152. Its totient is φ = 20130574659052.
The previous prime is 20131300322099. The next prime is 20131300322113. The reversal of 20131300322101 is 10122300313102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20131300322101 - 21 = 20131300322099 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 (20131300320101) 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, 362789911 + ... + 362845396.
It is an arithmetic number, because the mean of its divisors is an integer number (5033006496288).
Almost surely, 220131300322101 is an apocalyptic number.
It is an amenable number.
20131300322101 is a deficient number, since it is larger than the sum of its proper divisors (725663051).
20131300322101 is an equidigital number, since it uses as much as digits as its factorization.
20131300322101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725663050.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20131300322101 its reverse (10122300313102), we get a palindrome (30253600635203).
The spelling of 20131300322101 in words is "twenty trillion, one hundred thirty-one billion, three hundred million, three hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •