Base | Representation |
---|---|
bin | 1001001011111111000001… |
… | …01101110111001110000101 |
3 | 2122112101110220020122101210 |
4 | 10211333200231313032011 |
5 | 10122001221313442013 |
6 | 110545044120442033 |
7 | 4153422130505013 |
oct | 445774055671605 |
9 | 78471426218353 |
10 | 20203001312133 |
11 | 648a054605492 |
12 | 2323588319319 |
13 | b3719a356743 |
14 | 4dbb8aba78b3 |
15 | 2507d6a5ccc3 |
hex | 125fe0b77385 |
20203001312133 has 8 divisors (see below), whose sum is σ = 26937413032096. Its totient is φ = 13468628566800.
The previous prime is 20203001312107. The next prime is 20203001312149. The reversal of 20203001312133 is 33121310030202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20203001312133 - 213 = 20203001303941 is a prime.
It is a super-2 number, since 2×202030013121332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20203001319133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8511898 + ... + 10623483.
It is an arithmetic number, because the mean of its divisors is an integer number (3367176629012).
Almost surely, 220203001312133 is an apocalyptic number.
It is an amenable number.
20203001312133 is a deficient number, since it is larger than the sum of its proper divisors (6734411719963).
20203001312133 is a wasteful number, since it uses less digits than its factorization.
20203001312133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19487315.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20203001312133 its reverse (33121310030202), we get a palindrome (53324311342335).
The spelling of 20203001312133 in words is "twenty trillion, two hundred three billion, one million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •