Base | Representation |
---|---|
bin | 1011000001100011000001… |
… | …1011011111000111010011 |
3 | 1120220202221222111022102022 |
4 | 2300120300123133013103 |
5 | 3042043214304033021 |
6 | 41440223533442055 |
7 | 2360504613623033 |
oct | 260306033370723 |
9 | 46822858438368 |
10 | 12121210221011 |
11 | 3953638196981 |
12 | 143920894032b |
13 | 69c043539758 |
14 | 2dc9539558c3 |
15 | 1604792801ab |
hex | b06306df1d3 |
12121210221011 has 4 divisors (see below), whose sum is σ = 12123318630000. Its totient is φ = 12119101812024.
The previous prime is 12121210221007. The next prime is 12121210221017. The reversal of 12121210221011 is 11012201212121.
12121210221011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12121210221011 - 22 = 12121210221007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12121210221017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1054195871 + ... + 1054207368.
It is an arithmetic number, because the mean of its divisors is an integer number (3030829657500).
Almost surely, 212121210221011 is an apocalyptic number.
12121210221011 is a deficient number, since it is larger than the sum of its proper divisors (2108408989).
12121210221011 is an equidigital number, since it uses as much as digits as its factorization.
12121210221011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2108408988.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12121210221011 its reverse (11012201212121), we get a palindrome (23133411433132).
The spelling of 12121210221011 in words is "twelve trillion, one hundred twenty-one billion, two hundred ten million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •