Base | Representation |
---|---|
bin | 1001001001111001001011… |
… | …00101101001100101111001 |
3 | 2122021111222220220210022210 |
4 | 10210330211211221211321 |
5 | 10114312034414434113 |
6 | 110452041421405333 |
7 | 4145266321366251 |
oct | 444744545514571 |
9 | 78244886823283 |
10 | 20131142343033 |
11 | 646162a042417 |
12 | 2311672a09849 |
13 | b30487a43397 |
14 | 4d84d1328961 |
15 | 24d9cd1466c3 |
hex | 124f25969979 |
20131142343033 has 8 divisors (see below), whose sum is σ = 27164914969248. Its totient is φ = 13259065639424.
The previous prime is 20131142343031. The next prime is 20131142343049. The reversal of 20131142343033 is 33034324113102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20131142343033 - 21 = 20131142343031 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20131142343031) 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 7 ways as a sum of consecutive naturals, for example, 40423980360 + ... + 40423980857.
It is an arithmetic number, because the mean of its divisors is an integer number (3395614371156).
Almost surely, 220131142343033 is an apocalyptic number.
It is an amenable number.
20131142343033 is a deficient number, since it is larger than the sum of its proper divisors (7033772626215).
20131142343033 is an equidigital number, since it uses as much as digits as its factorization.
20131142343033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80847961303.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 20131142343033 its reverse (33034324113102), we get a palindrome (53165466456135).
The spelling of 20131142343033 in words is "twenty trillion, one hundred thirty-one billion, one hundred forty-two million, three hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •