Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …01000110001011001011001 |
3 | 2121211002121212002002201120 |
4 | 10203003211020301121121 |
5 | 10110144440233341441 |
6 | 110312232511435453 |
7 | 4133016451656624 |
oct | 443034510613131 |
9 | 77732555062646 |
10 | 20001212012121 |
11 | 641151482874a |
12 | 22b0451525b89 |
13 | b2114c422882 |
14 | 4d20c71d6dbb |
15 | 24a426495966 |
hex | 1230e5231659 |
20001212012121 has 16 divisors (see below), whose sum is σ = 28260278376000. Its totient is φ = 12547563588288.
The previous prime is 20001212012113. The next prime is 20001212012149. The reversal of 20001212012121 is 12121021210002.
It is not a de Polignac number, because 20001212012121 - 23 = 20001212012113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20001212012121.
It is not an unprimeable number, because it can be changed into a prime (20001212712121) 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 15 ways as a sum of consecutive naturals, for example, 1177503106 + ... + 1177520091.
It is an arithmetic number, because the mean of its divisors is an integer number (1766267398500).
Almost surely, 220001212012121 is an apocalyptic number.
It is an amenable number.
20001212012121 is a deficient number, since it is larger than the sum of its proper divisors (8259066363879).
20001212012121 is a wasteful number, since it uses less digits than its factorization.
20001212012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2355023368.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20001212012121 its reverse (12121021210002), we get a palindrome (32122233222123).
The spelling of 20001212012121 in words is "twenty trillion, one billion, two hundred twelve million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •