Base | Representation |
---|---|
bin | 1001001001111011010110… |
… | …10000110111101110011111 |
3 | 2122021122000101112000020011 |
4 | 10210331223100313232133 |
5 | 10114321433143113043 |
6 | 110452353420304051 |
7 | 4145340304356115 |
oct | 444755320675637 |
9 | 78248011460204 |
10 | 20132311301023 |
11 | 64620799768a9 |
12 | 231193a3a2027 |
13 | b30612c894bc |
14 | 4d85a2697ab5 |
15 | 24da4aa9e59d |
hex | 124f6b437b9f |
20132311301023 has 4 divisors (see below), whose sum is σ = 20141957834640. Its totient is φ = 20122664767408.
The previous prime is 20132311300931. The next prime is 20132311301057. The reversal of 20132311301023 is 32010311323102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20132311301023 - 29 = 20132311300511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20132311300985 and 20132311301003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132311301723) 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, 4823263678 + ... + 4823267851.
It is an arithmetic number, because the mean of its divisors is an integer number (5035489458660).
Almost surely, 220132311301023 is an apocalyptic number.
20132311301023 is a deficient number, since it is larger than the sum of its proper divisors (9646533617).
20132311301023 is an equidigital number, since it uses as much as digits as its factorization.
20132311301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9646533616.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20132311301023 its reverse (32010311323102), we get a palindrome (52142622624125).
The spelling of 20132311301023 in words is "twenty trillion, one hundred thirty-two billion, three hundred eleven million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •