Base | Representation |
---|---|
bin | 1001001111001000111011… |
… | …11110010000111000010001 |
3 | 2122220202021121112022200221 |
4 | 10213210131332100320101 |
5 | 10130240223210012423 |
6 | 111110532501313041 |
7 | 4164310335415300 |
oct | 447443576207021 |
9 | 78822247468627 |
10 | 20311403204113 |
11 | 652102165636a |
12 | 234059ba05781 |
13 | b44484730aa8 |
14 | 503111a2a437 |
15 | 25352d6cbe5d |
hex | 12791df90e11 |
20311403204113 has 12 divisors (see below), whose sum is σ = 23627624898420. Its totient is φ = 17409719477472.
The previous prime is 20311403204089. The next prime is 20311403204203. The reversal of 20311403204113 is 31140230411302.
It can be written as a sum of positive squares in 2 ways, for example, as 4497483008529 + 15813920195584 = 2120727^2 + 3976672^2 .
It is a de Polignac number, because none of the positive numbers 2k-20311403204113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20311403204713) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26758623 + ... + 27507211.
It is an arithmetic number, because the mean of its divisors is an integer number (1968968741535).
Almost surely, 220311403204113 is an apocalyptic number.
It is an amenable number.
20311403204113 is a deficient number, since it is larger than the sum of its proper divisors (3316221694307).
20311403204113 is an equidigital number, since it uses as much as digits as its factorization.
20311403204113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1302336 (or 1302329 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 20311403204113 its reverse (31140230411302), we get a palindrome (51451633615415).
The spelling of 20311403204113 in words is "twenty trillion, three hundred eleven billion, four hundred three million, two hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •