Base | Representation |
---|---|
bin | 10110101111101010… |
… | …10011101001001001 |
3 | 1011112000011120211010 |
4 | 23113311103221021 |
5 | 200002004310441 |
6 | 5335404154133 |
7 | 611412605412 |
oct | 132765235111 |
9 | 34460146733 |
10 | 12211010121 |
11 | 51a6884702 |
12 | 2449538949 |
13 | 11c7aa539b |
14 | 83ba68809 |
15 | 4b7052116 |
hex | 2d7d53a49 |
12211010121 has 8 divisors (see below), whose sum is σ = 17239073184. Its totient is φ = 7661810240.
The previous prime is 12211010099. The next prime is 12211010159. The reversal of 12211010121 is 12101011221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12211010121 - 25 = 12211010089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12211010097 and 12211010106.
It is not an unprimeable number, because it can be changed into a prime (12211010221) 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 7 ways as a sum of consecutive naturals, for example, 119715735 + ... + 119715836.
It is an arithmetic number, because the mean of its divisors is an integer number (2154884148).
Almost surely, 212211010121 is an apocalyptic number.
It is an amenable number.
12211010121 is a deficient number, since it is larger than the sum of its proper divisors (5028063063).
12211010121 is a wasteful number, since it uses less digits than its factorization.
12211010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239431591.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12211010121 its reverse (12101011221), we get a palindrome (24312021342).
It can be divided in two parts, 122110 and 10121, that added together give a palindrome (132231).
The spelling of 12211010121 in words is "twelve billion, two hundred eleven million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •