Base | Representation |
---|---|
bin | 1001000110111101000000… |
… | …01100011101101010000001 |
3 | 2121220212020111210021211012 |
4 | 10203132200030131222001 |
5 | 10111133141222414014 |
6 | 110333413220530305 |
7 | 4135062022603403 |
oct | 443364014355201 |
9 | 77825214707735 |
10 | 20030120123009 |
11 | 64227a9697287 |
12 | 22b5b7a850995 |
13 | b23aa8516a29 |
14 | 4d366a614b73 |
15 | 24b0692dbc3e |
hex | 1237a031da81 |
20030120123009 has 4 divisors (see below), whose sum is σ = 21208362483204. Its totient is φ = 18851877762816.
The previous prime is 20030120122997. The next prime is 20030120123147. The reversal of 20030120123009 is 90032102103002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10048722480784 + 9981397642225 = 3169972^2 + 3159335^2 .
It is not a de Polignac number, because 20030120123009 - 212 = 20030120118913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20030120113009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 589121180072 + ... + 589121180105.
It is an arithmetic number, because the mean of its divisors is an integer number (5302090620801).
Almost surely, 220030120123009 is an apocalyptic number.
It is an amenable number.
20030120123009 is a deficient number, since it is larger than the sum of its proper divisors (1178242360195).
20030120123009 is a wasteful number, since it uses less digits than its factorization.
20030120123009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1178242360194.
The product of its (nonzero) digits is 648, while the sum is 23.
The spelling of 20030120123009 in words is "twenty trillion, thirty billion, one hundred twenty million, one hundred twenty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •