Base | Representation |
---|---|
bin | 1001001011111101010110… |
… | …00111010000110101101011 |
3 | 2122112022011020000220110011 |
4 | 10211332223013100311223 |
5 | 10121442401103013003 |
6 | 110544414553232351 |
7 | 4153360630465456 |
oct | 445765307206553 |
9 | 78468136026404 |
10 | 20202102001003 |
11 | 6489732a0374a |
12 | 23233771026b7 |
13 | b37085c41790 |
14 | 4dbb0358a49d |
15 | 250782b1a46d |
hex | 125fab1d0d6b |
20202102001003 has 8 divisors (see below), whose sum is σ = 21756169290800. Its totient is φ = 18648043203168.
The previous prime is 20202102001001. The next prime is 20202102001009. The reversal of 20202102001003 is 30010020120202.
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 20202102001003 - 21 = 20202102001001 is a prime.
It is a super-2 number, since 2×202021020010032 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20202102001001) 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, 3338293 + ... + 7179721.
It is an arithmetic number, because the mean of its divisors is an integer number (2719521161350).
Almost surely, 220202102001003 is an apocalyptic number.
20202102001003 is a deficient number, since it is larger than the sum of its proper divisors (1554067289797).
20202102001003 is a wasteful number, since it uses less digits than its factorization.
20202102001003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4245981.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20202102001003 its reverse (30010020120202), we get a palindrome (50212122121205).
The spelling of 20202102001003 in words is "twenty trillion, two hundred two billion, one hundred two million, one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •