Base | Representation |
---|---|
bin | 11011100011111111111101… |
… | …110111010001111101001010 |
3 | 120220012121220100121022121012 |
4 | 123203333331313101331022 |
5 | 111342041324001401442 |
6 | 1105452114140243522 |
7 | 34350636246361550 |
oct | 3343777567217512 |
9 | 526177810538535 |
10 | 121221121122122 |
11 | 35696652710a2a |
12 | 117195702405a2 |
13 | 5284144757078 |
14 | 21d11c2719bd0 |
15 | e0338d716582 |
hex | 6e3ffddd1f4a |
121221121122122 has 8 divisors (see below), whose sum is σ = 207807636209376. Its totient is φ = 51951909052332.
The previous prime is 121221121122109. The next prime is 121221121122149. The reversal of 121221121122122 is 221221121122121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1212211211221222 (a number of 29 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4329325754348 + ... + 4329325754375.
It is an arithmetic number, because the mean of its divisors is an integer number (25975954526172).
Almost surely, 2121221121122122 is an apocalyptic number.
121221121122122 is a deficient number, since it is larger than the sum of its proper divisors (86586515087254).
121221121122122 is an equidigital number, since it uses as much as digits as its factorization.
121221121122122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8658651508732.
The product of its digits is 256, while the sum is 23.
Adding to 121221121122122 its reverse (221221121122121), we get a palindrome (342442242244243).
Subtracting 121221121122122 from its reverse (221221121122121), we obtain a palindrome (99999999999999).
The spelling of 121221121122122 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •