Base | Representation |
---|---|
bin | 11011100011111111110111… |
… | …111101111111111101000101 |
3 | 120220012121122110111120112101 |
4 | 123203333313331333331011 |
5 | 111342041123142020401 |
6 | 1105452100244352101 |
7 | 34350633635621506 |
oct | 3343776775777505 |
9 | 526177573446471 |
10 | 121221022220101 |
11 | 356966018aa421 |
12 | 117195430a5631 |
13 | 528412a10926b |
14 | 21d11b3532bad |
15 | e03384bcc101 |
hex | 6e3ff7f7ff45 |
121221022220101 has 8 divisors (see below), whose sum is σ = 125684129846880. Its totient is φ = 116776786085232.
The previous prime is 121221022220047. The next prime is 121221022220117. The reversal of 121221022220101 is 101022220122121.
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-121221022220101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121221022220131) 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, 4717859895 + ... + 4717885588.
It is an arithmetic number, because the mean of its divisors is an integer number (15710516230860).
Almost surely, 2121221022220101 is an apocalyptic number.
It is an amenable number.
121221022220101 is a deficient number, since it is larger than the sum of its proper divisors (4463107626779).
121221022220101 is an equidigital number, since it uses as much as digits as its factorization.
121221022220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9435745955.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 121221022220101 its reverse (101022220122121), we get a palindrome (222243242342222).
The spelling of 121221022220101 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, twenty-two million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •