Base | Representation |
---|---|
bin | 1001001111101011110001… |
… | …00001101010010100110011 |
3 | 2122222112112210011220202001 |
4 | 10213311320201222110303 |
5 | 10131042022142131003 |
6 | 111123304200034431 |
7 | 4165541613213544 |
oct | 447657041522463 |
9 | 78875483156661 |
10 | 20330102302003 |
11 | 6528a4782137a |
12 | 234413a162a17 |
13 | b46174745c60 |
14 | 503da72384cb |
15 | 253c7512a61d |
hex | 127d7886a533 |
20330102302003 has 4 divisors (see below), whose sum is σ = 21893956325248. Its totient is φ = 18766248278760.
The previous prime is 20330102301991. The next prime is 20330102302057. The reversal of 20330102302003 is 30020320103302.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20330102302003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20330102602003) 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 3 ways as a sum of consecutive naturals, for example, 781927011603 + ... + 781927011628.
It is an arithmetic number, because the mean of its divisors is an integer number (5473489081312).
Almost surely, 220330102302003 is an apocalyptic number.
20330102302003 is a deficient number, since it is larger than the sum of its proper divisors (1563854023245).
20330102302003 is a wasteful number, since it uses less digits than its factorization.
20330102302003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1563854023244.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 20330102302003 its reverse (30020320103302), we get a palindrome (50350422405305).
The spelling of 20330102302003 in words is "twenty trillion, three hundred thirty billion, one hundred two million, three hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •