Base | Representation |
---|---|
bin | 11011100010011010010110… |
… | …010101110001000111100101 |
3 | 120212211012021012222011021221 |
4 | 123202122112111301013211 |
5 | 111333244344041214341 |
6 | 1105330031144340341 |
7 | 34340024341116106 |
oct | 3342322625610745 |
9 | 525735235864257 |
10 | 121112010101221 |
11 | 35654351355a97 |
12 | 1170039b1746b1 |
13 | 5276a764953c9 |
14 | 21c9bd16243ad |
15 | e006046beed1 |
hex | 6e26965711e5 |
121112010101221 has 32 divisors (see below), whose sum is σ = 126709558272000. Its totient is φ = 115663702085568.
The previous prime is 121112010101209. The next prime is 121112010101239. The reversal of 121112010101221 is 122101010211121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121112010101221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121112010101195 and 121112010101204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121112010101521) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 502537876 + ... + 502778818.
It is an arithmetic number, because the mean of its divisors is an integer number (3959673696000).
Almost surely, 2121112010101221 is an apocalyptic number.
It is an amenable number.
121112010101221 is a deficient number, since it is larger than the sum of its proper divisors (5597548170779).
121112010101221 is a wasteful number, since it uses less digits than its factorization.
121112010101221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242113.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121112010101221 its reverse (122101010211121), we get a palindrome (243213020312342).
The spelling of 121112010101221 in words is "one hundred twenty-one trillion, one hundred twelve billion, ten million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •