Base | Representation |
---|---|
bin | 1001001011111111000010… |
… | …11011010011001011011011 |
3 | 2122112101111201122210012212 |
4 | 10211333201123103023123 |
5 | 10122001232341120011 |
6 | 110545045224025335 |
7 | 4153422333653654 |
oct | 445774133231333 |
9 | 78471451583185 |
10 | 20203013223131 |
11 | 648a060300392 |
12 | 232359030224b |
13 | b3719c96707b |
14 | 4dbb8c5c852b |
15 | 2507d7b1208b |
hex | 125fe16d32db |
20203013223131 has 32 divisors (see below), whose sum is σ = 21540028612608. Its totient is φ = 18925430499360.
The previous prime is 20203013223109. The next prime is 20203013223137. The reversal of 20203013223131 is 13132231030202.
It is a cyclic number.
It is not a de Polignac number, because 20203013223131 - 230 = 20201939481307 is a prime.
It is a super-2 number, since 2×202030132231312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20203013223097 and 20203013223106.
It is not an unprimeable number, because it can be changed into a prime (20203013223137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25472156 + ... + 26253318.
It is an arithmetic number, because the mean of its divisors is an integer number (673125894144).
Almost surely, 220203013223131 is an apocalyptic number.
20203013223131 is a deficient number, since it is larger than the sum of its proper divisors (1337015389477).
20203013223131 is a wasteful number, since it uses less digits than its factorization.
20203013223131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 781511.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20203013223131 its reverse (13132231030202), we get a palindrome (33335244253333).
The spelling of 20203013223131 in words is "twenty trillion, two hundred three billion, thirteen million, two hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •