Base | Representation |
---|---|
bin | 1011000001100011000100… |
… | …1000111000011000110011 |
3 | 1120220202222210212220011001 |
4 | 2300120301020320120303 |
5 | 3042043230330333021 |
6 | 41440225040502431 |
7 | 2360505120024643 |
oct | 260306110703063 |
9 | 46822883786131 |
10 | 12121222121011 |
11 | 3953643984593 |
12 | 143921091aa17 |
13 | 69c045b45083 |
14 | 2dc955372523 |
15 | 16047a331091 |
hex | b0631238633 |
12121222121011 has 8 divisors (see below), whose sum is σ = 12329551600560. Its totient is φ = 11912988809472.
The previous prime is 12121222121009. The next prime is 12121222121017. The reversal of 12121222121011 is 11012122212121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12121222121011 - 21 = 12121222121009 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12121222121011.
It is not an unprimeable number, because it can be changed into a prime (12121222121017) 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, 23787730 + ... + 24291943.
It is an arithmetic number, because the mean of its divisors is an integer number (1541193950070).
Almost surely, 212121222121011 is an apocalyptic number.
12121222121011 is a deficient number, since it is larger than the sum of its proper divisors (208329479549).
12121222121011 is an equidigital number, since it uses as much as digits as its factorization.
12121222121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48084005.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 12121222121011 its reverse (11012122212121), we get a palindrome (23133344333132).
The spelling of 12121222121011 in words is "twelve trillion, one hundred twenty-one billion, two hundred twenty-two million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •