Base | Representation |
---|---|
bin | 1010111011101110100010… |
… | …1000000001111101101011 |
3 | 1120120012212120200221121011 |
4 | 2232323220220001331223 |
5 | 3033423430123131443 |
6 | 41322250044124351 |
7 | 2350335033056005 |
oct | 256735050017553 |
9 | 46505776627534 |
10 | 12021221302123 |
11 | 391519803a220 |
12 | 14219628366b7 |
13 | 69279a1099a7 |
14 | 2d7b8a17b375 |
15 | 15ca75ed3b9d |
hex | aeee8a01f6b |
12021221302123 has 16 divisors (see below), whose sum is σ = 13582633471200. Its totient is φ = 10538813940480.
The previous prime is 12021221302117. The next prime is 12021221302163. The reversal of 12021221302123 is 32120312212021.
It is a cyclic number.
It is not a de Polignac number, because 12021221302123 - 217 = 12021221171051 is a prime.
It is a super-3 number, since 3×120212213021233 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12021221302094 and 12021221302103.
It is not an unprimeable number, because it can be changed into a prime (12021221302163) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22464186 + ... + 22993087.
It is an arithmetic number, because the mean of its divisors is an integer number (848914591950).
Almost surely, 212021221302123 is an apocalyptic number.
12021221302123 is a deficient number, since it is larger than the sum of its proper divisors (1561412169077).
12021221302123 is a wasteful number, since it uses less digits than its factorization.
12021221302123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45458142.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12021221302123 its reverse (32120312212021), we get a palindrome (44141533514144).
The spelling of 12021221302123 in words is "twelve trillion, twenty-one billion, two hundred twenty-one million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •