Base | Representation |
---|---|
bin | 1001001011111111000001… |
… | …10001010000001111000111 |
3 | 2122112101110221220210201221 |
4 | 10211333200301100033013 |
5 | 10122001222030413111 |
6 | 110545044151501211 |
7 | 4153422141166366 |
oct | 445774061201707 |
9 | 78471427823657 |
10 | 20203002201031 |
11 | 648a055062311 |
12 | 2323588687807 |
13 | b3719a5a8210 |
14 | 4dbb8ad597dd |
15 | 2507d6b86371 |
hex | 125fe0c503c7 |
20203002201031 has 16 divisors (see below), whose sum is σ = 21837757971456. Its totient is φ = 18579794891616.
The previous prime is 20203002201017. The next prime is 20203002201121. The reversal of 20203002201031 is 13010220030202.
It is a cyclic number.
It is not a de Polignac number, because 20203002201031 - 29 = 20203002200519 is a prime.
It is a super-2 number, since 2×202030022010312 (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 = 20203002200996 and 20203002201014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20203002201131) 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, 20800866 + ... + 21750448.
It is an arithmetic number, because the mean of its divisors is an integer number (1364859873216).
Almost surely, 220203002201031 is an apocalyptic number.
20203002201031 is a deficient number, since it is larger than the sum of its proper divisors (1634755770425).
20203002201031 is a wasteful number, since it uses less digits than its factorization.
20203002201031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 955662.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 20203002201031 its reverse (13010220030202), we get a palindrome (33213222231233).
The spelling of 20203002201031 in words is "twenty trillion, two hundred three billion, two million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •