Base | Representation |
---|---|
bin | 11101001010011011010… |
… | …01001011011011001111 |
3 | 10112210102012021010211012 |
4 | 32211031221023123033 |
5 | 112404124141122203 |
6 | 2044154244515435 |
7 | 132252144432404 |
oct | 16451551133317 |
9 | 3483365233735 |
10 | 1002030020303 |
11 | 356a5a907224 |
12 | 1422499abb7b |
13 | 7364ca241a0 |
14 | 366d9cb82ab |
15 | 1b0e9aa8bd8 |
hex | e94da4b6cf |
1002030020303 has 8 divisors (see below), whose sum is σ = 1080124422048. Its totient is φ = 924080642784.
The previous prime is 1002030020293. The next prime is 1002030020323. The reversal of 1002030020303 is 3030200302001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1002030020303 - 228 = 1001761584847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002030020323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36241700 + ... + 36269337.
It is an arithmetic number, because the mean of its divisors is an integer number (135015552756).
Almost surely, 21002030020303 is an apocalyptic number.
1002030020303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1002030020303 is a deficient number, since it is larger than the sum of its proper divisors (78094401745).
1002030020303 is a wasteful number, since it uses less digits than its factorization.
1002030020303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72512113.
The product of its (nonzero) digits is 108, while the sum is 14.
Adding to 1002030020303 its reverse (3030200302001), we get a palindrome (4032230322304).
The spelling of 1002030020303 in words is "one trillion, two billion, thirty million, twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •