Base | Representation |
---|---|
bin | 1001000111001111110111… |
… | …1000101001100010000111 |
3 | 1022110220200121121202021122 |
4 | 2101303331320221202013 |
5 | 2303132203021020403 |
6 | 33151103035304155 |
7 | 2052633665033423 |
oct | 221637570514207 |
9 | 38426617552248 |
10 | 10020123220103 |
11 | 3213568374137 |
12 | 1159b72bab05b |
13 | 578b80216959 |
14 | 268d9592bb83 |
15 | 1259a68ed838 |
hex | 91cfde29887 |
10020123220103 has 4 divisors (see below), whose sum is σ = 10040530803528. Its totient is φ = 9999715636680.
The previous prime is 10020123220097. The next prime is 10020123220117. The reversal of 10020123220103 is 30102232102001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10020123220103 - 26 = 10020123220039 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 (10020123220123) 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, 10203790976 + ... + 10203791957.
It is an arithmetic number, because the mean of its divisors is an integer number (2510132700882).
Almost surely, 210020123220103 is an apocalyptic number.
10020123220103 is a deficient number, since it is larger than the sum of its proper divisors (20407583425).
10020123220103 is an equidigital number, since it uses as much as digits as its factorization.
10020123220103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20407583424.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10020123220103 its reverse (30102232102001), we get a palindrome (40122355322104).
The spelling of 10020123220103 in words is "ten trillion, twenty billion, one hundred twenty-three million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •