Base | Representation |
---|---|
bin | 1001001001101010010000… |
… | …01001110011101011110111 |
3 | 2122020202022200122001212021 |
4 | 10210311020021303223313 |
5 | 10114144133332443221 |
6 | 110444234522534011 |
7 | 4144563656301100 |
oct | 444651011635367 |
9 | 78222280561767 |
10 | 20123132312311 |
11 | 6459199643816 |
12 | 230bbb8367307 |
13 | b2c7ac3ca732 |
14 | 4d7d715ad3a7 |
15 | 24d6aed19041 |
hex | 124d48273af7 |
20123132312311 has 6 divisors (see below), whose sum is σ = 23408541669480. Its totient is φ = 17248399124796.
The previous prime is 20123132312237. The next prime is 20123132312317. The reversal of 20123132312311 is 11321323132102.
It is not a de Polignac number, because 20123132312311 - 223 = 20123123923703 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 (20123132312317) 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 5 ways as a sum of consecutive naturals, for example, 205338084771 + ... + 205338084868.
It is an arithmetic number, because the mean of its divisors is an integer number (3901423611580).
Almost surely, 220123132312311 is an apocalyptic number.
20123132312311 is a deficient number, since it is larger than the sum of its proper divisors (3285409357169).
20123132312311 is an equidigital number, since it uses as much as digits as its factorization.
20123132312311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410676169653 (or 410676169646 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 20123132312311 its reverse (11321323132102), we get a palindrome (31444455444413).
The spelling of 20123132312311 in words is "twenty trillion, one hundred twenty-three billion, one hundred thirty-two million, three hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •