Base | Representation |
---|---|
bin | 1001000110101010011000… |
… | …01101010011010011010011 |
3 | 2121212220102122220102001121 |
4 | 10203111030031103103103 |
5 | 10111002202001401003 |
6 | 110325041111343111 |
7 | 4134256156522102 |
oct | 443251415232323 |
9 | 77786378812047 |
10 | 20020121122003 |
11 | 64195384a4892 |
12 | 22b404a081a97 |
13 | b22b73ab91a2 |
14 | 4d2d9c672039 |
15 | 24ab81579cbd |
hex | 12354c3534d3 |
20020121122003 has 8 divisors (see below), whose sum is σ = 20711677615200. Its totient is φ = 19328645128128.
The previous prime is 20020121121989. The next prime is 20020121122051. The reversal of 20020121122003 is 30022112102002.
It is a happy number.
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 20020121122003 - 25 = 20020121121971 is a prime.
It is a super-2 number, since 2×200201211220032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20020121122103) 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, 19618626 + ... + 20613847.
It is an arithmetic number, because the mean of its divisors is an integer number (2588959701900).
Almost surely, 220020121122003 is an apocalyptic number.
20020121122003 is a deficient number, since it is larger than the sum of its proper divisors (691556493197).
20020121122003 is a wasteful number, since it uses less digits than its factorization.
20020121122003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40249661.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 20020121122003 its reverse (30022112102002), we get a palindrome (50042233224005).
The spelling of 20020121122003 in words is "twenty trillion, twenty billion, one hundred twenty-one million, one hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •