Base | Representation |
---|---|
bin | 10010101110000011… |
… | …011101100001011001 |
3 | 1220212210201102002101 |
4 | 102232003131201121 |
5 | 312131100341441 |
6 | 13122301003401 |
7 | 1311045166300 |
oct | 225603354131 |
9 | 56783642071 |
10 | 20100012121 |
11 | 8584a29672 |
12 | 3a8b553561 |
13 | 1b84323ac7 |
14 | d896bb437 |
15 | 7c9924231 |
hex | 4ae0dd859 |
20100012121 has 12 divisors (see below), whose sum is σ = 23613154020. Its totient is φ = 17057997600.
The previous prime is 20100012103. The next prime is 20100012181. The reversal of 20100012121 is 12121000102.
It can be written as a sum of positive squares in 2 ways, for example, as 17098177600 + 3001834521 = 130760^2 + 54789^2 .
It is not a de Polignac number, because 20100012121 - 225 = 20066457689 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20100012098 and 20100012107.
It is not an unprimeable number, because it can be changed into a prime (20100012181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2025766 + ... + 2035663.
It is an arithmetic number, because the mean of its divisors is an integer number (1967762835).
Almost surely, 220100012121 is an apocalyptic number.
It is an amenable number.
20100012121 is a deficient number, since it is larger than the sum of its proper divisors (3513141899).
20100012121 is a wasteful number, since it uses less digits than its factorization.
20100012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4061544 (or 4061537 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20100012121 its reverse (12121000102), we get a palindrome (32221012223).
The spelling of 20100012121 in words is "twenty billion, one hundred million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •