Base | Representation |
---|---|
bin | 1011000000011011100010… |
… | …1010011010111110100001 |
3 | 1120211221102122120221101112 |
4 | 2300012320222122332201 |
5 | 3041234414334013441 |
6 | 41423331450113105 |
7 | 2356225235141402 |
oct | 260067052327641 |
9 | 46757378527345 |
10 | 12102021001121 |
11 | 39464903a0a67 |
12 | 143555241b795 |
13 | 69a2a5b1a67c |
14 | 2dba532039a9 |
15 | 15ec047ba4eb |
hex | b01b8a9afa1 |
12102021001121 has 8 divisors (see below), whose sum is σ = 12340674464640. Its totient is φ = 11864485353168.
The previous prime is 12102021001069. The next prime is 12102021001157. The reversal of 12102021001121 is 12110012020121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12102021001121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12102021001096 and 12102021001105.
It is not an unprimeable number, because it can be changed into a prime (12102021004121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 279432026 + ... + 279475331.
It is an arithmetic number, because the mean of its divisors is an integer number (1542584308080).
Almost surely, 212102021001121 is an apocalyptic number.
It is an amenable number.
12102021001121 is a deficient number, since it is larger than the sum of its proper divisors (238653463519).
12102021001121 is an equidigital number, since it uses as much as digits as its factorization.
12102021001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558907783.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12102021001121 its reverse (12110012020121), we get a palindrome (24212033021242).
The spelling of 12102021001121 in words is "twelve trillion, one hundred two billion, twenty-one million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •