Base | Representation |
---|---|
bin | 1001000110101111111110… |
… | …00101001100110111000011 |
3 | 2121220012011210210220120102 |
4 | 10203113333011030313003 |
5 | 10111024323230321011 |
6 | 110330254553233015 |
7 | 4134423426552554 |
oct | 443277705146703 |
9 | 77805153726512 |
10 | 20023122120131 |
11 | 641a838487129 |
12 | 22b474710276b |
13 | b2323175cb20 |
14 | 4d31a505832b |
15 | 24aca9c6973b |
hex | 1235ff14cdc3 |
20023122120131 has 8 divisors (see below), whose sum is σ = 21563455579680. Its totient is φ = 18482801988672.
The previous prime is 20023122120107. The next prime is 20023122120161. The reversal of 20023122120131 is 13102122132002.
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 20023122120131 - 210 = 20023122119107 is a prime.
It is a super-3 number, since 3×200231221201313 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20023122120161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95351 + ... + 6328928.
It is an arithmetic number, because the mean of its divisors is an integer number (2695431947460).
Almost surely, 220023122120131 is an apocalyptic number.
20023122120131 is a deficient number, since it is larger than the sum of its proper divisors (1540333459549).
20023122120131 is a wasteful number, since it uses less digits than its factorization.
20023122120131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6664045.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 20023122120131 its reverse (13102122132002), we get a palindrome (33125244252133).
The spelling of 20023122120131 in words is "twenty trillion, twenty-three billion, one hundred twenty-two million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •