Base | Representation |
---|---|
bin | 1001001001111001010010… |
… | …00110101001000001111101 |
3 | 2122021112011000220021210221 |
4 | 10210330221012221001331 |
5 | 10114312200014320013 |
6 | 110452051325501341 |
7 | 4145300635615015 |
oct | 444745106510175 |
9 | 78245130807727 |
10 | 20131201323133 |
11 | 646165a366aaa |
12 | 231168a711851 |
13 | b30497024054 |
14 | 4d84d90bcc45 |
15 | 24d9d33e708d |
hex | 124f291a907d |
20131201323133 has 16 divisors (see below), whose sum is σ = 21108423283200. Its totient is φ = 19182206337840.
The previous prime is 20131201323131. The next prime is 20131201323143. The reversal of 20131201323133 is 33132310213102.
It is a cyclic number.
It is not a de Polignac number, because 20131201323133 - 21 = 20131201323131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20131201323098 and 20131201323107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20131201323131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29954073 + ... + 30618766.
It is an arithmetic number, because the mean of its divisors is an integer number (1319276455200).
Almost surely, 220131201323133 is an apocalyptic number.
It is an amenable number.
20131201323133 is a deficient number, since it is larger than the sum of its proper divisors (977221960067).
20131201323133 is a wasteful number, since it uses less digits than its factorization.
20131201323133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60573072.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 20131201323133 its reverse (33132310213102), we get a palindrome (53263511536235).
The spelling of 20131201323133 in words is "twenty trillion, one hundred thirty-one billion, two hundred one million, three hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •