Base | Representation |
---|---|
bin | 1001010001111001100000… |
… | …1101111111100011010011 |
3 | 1100010101222122211211001222 |
4 | 2110132120031333203103 |
5 | 2314131422342224021 |
6 | 33411123455115255 |
7 | 2102102233445363 |
oct | 224363015774323 |
9 | 40111878754058 |
10 | 10203101133011 |
11 | 3284124660366 |
12 | 1189519b12b2b |
13 | 5901c0aab337 |
14 | 273b930209a3 |
15 | 12a6157866ab |
hex | 9479837f8d3 |
10203101133011 has 8 divisors (see below), whose sum is σ = 10218122413584. Its totient is φ = 10188080592480.
The previous prime is 10203101133007. The next prime is 10203101133019. The reversal of 10203101133011 is 11033110130201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10203101133011 - 22 = 10203101133007 is a prime.
It is a super-3 number, since 3×102031011330113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10203101133019) 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, 31356725 + ... + 31680441.
It is an arithmetic number, because the mean of its divisors is an integer number (1277265301698).
Almost surely, 210203101133011 is an apocalyptic number.
10203101133011 is a deficient number, since it is larger than the sum of its proper divisors (15021280573).
10203101133011 is an equidigital number, since it uses as much as digits as its factorization.
10203101133011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370021.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10203101133011 its reverse (11033110130201), we get a palindrome (21236211263212).
The spelling of 10203101133011 in words is "ten trillion, two hundred three billion, one hundred one million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •