Base | Representation |
---|---|
bin | 11011110001000110001001… |
… | …100000011110111100001110 |
3 | 121000101122221021110002202102 |
4 | 123301012021200132330032 |
5 | 112001313014200333402 |
6 | 1111421355302555102 |
7 | 34502650000553213 |
oct | 3361061140367416 |
9 | 530348837402672 |
10 | 122121112121102 |
11 | 35a03300113166 |
12 | 11843a81438a92 |
13 | 531ac823b1213 |
14 | 222299c83bb0a |
15 | e1b9b5066102 |
hex | 6f118981ef0e |
122121112121102 has 8 divisors (see below), whose sum is σ = 183181928154456. Its totient is φ = 61060469402952.
The previous prime is 122121112121093. The next prime is 122121112121123. The reversal of 122121112121102 is 201121211121221.
It is a happy number.
122121112121102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41552693 + ... + 44394464.
It is an arithmetic number, because the mean of its divisors is an integer number (22897741019307).
Almost surely, 2122121112121102 is an apocalyptic number.
122121112121102 is a deficient number, since it is larger than the sum of its proper divisors (61060816033354).
122121112121102 is an equidigital number, since it uses as much as digits as its factorization.
122121112121102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86657602.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 122121112121102 its reverse (201121211121221), we get a palindrome (323242323242323).
The spelling of 122121112121102 in words is "one hundred twenty-two trillion, one hundred twenty-one billion, one hundred twelve million, one hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •