Base | Representation |
---|---|
bin | 1011000001100010110001… |
… | …0101000110111000010101 |
3 | 1120220202210012001212122020 |
4 | 2300120230111012320111 |
5 | 3042043044202040041 |
6 | 41440213035323353 |
7 | 2360503120164255 |
oct | 260305425067025 |
9 | 46822705055566 |
10 | 12121141440021 |
11 | 3953602388789 |
12 | 14391a98b0559 |
13 | 69c032206a43 |
14 | 2dc94876d965 |
15 | 1604731e5866 |
hex | b062c546e15 |
12121141440021 has 32 divisors (see below), whose sum is σ = 16232951743488. Its totient is φ = 8045128114560.
The previous prime is 12121141439999. The next prime is 12121141440029. The reversal of 12121141440021 is 12004414112121.
It is not a de Polignac number, because 12121141440021 - 29 = 12121141439509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12121141439973 and 12121141440000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12121141440029) 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 31 ways as a sum of consecutive naturals, for example, 3187255906 + ... + 3187259708.
It is an arithmetic number, because the mean of its divisors is an integer number (507279741984).
Almost surely, 212121141440021 is an apocalyptic number.
It is an amenable number.
12121141440021 is a deficient number, since it is larger than the sum of its proper divisors (4111810303467).
12121141440021 is a wasteful number, since it uses less digits than its factorization.
12121141440021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8041.
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 12121141440021 its reverse (12004414112121), we get a palindrome (24125555552142).
The spelling of 12121141440021 in words is "twelve trillion, one hundred twenty-one billion, one hundred forty-one million, four hundred forty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •