Base | Representation |
---|---|
bin | 11011110001000110001110… |
… | …111000001001110100011010 |
3 | 121000101200011112222012101212 |
4 | 123301012032320021310122 |
5 | 112001313210231241442 |
6 | 1111421412241543122 |
7 | 34502652143405231 |
oct | 3361061670116432 |
9 | 530350145865355 |
10 | 122121202212122 |
11 | 35a03346a56953 |
12 | 11843aa7644aa2 |
13 | 531ac97c65709 |
14 | 22229aa7adb18 |
15 | e1b9bce0ea82 |
hex | 6f118ee09d1a |
122121202212122 has 8 divisors (see below), whose sum is σ = 183181994119872. Its totient is φ = 61060537505500.
The previous prime is 122121202212101. The next prime is 122121202212127. The reversal of 122121202212122 is 221212202121221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (122121202212127) by changing a digit.
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, 29362754 + ... + 33262797.
It is an arithmetic number, because the mean of its divisors is an integer number (22897749264984).
Almost surely, 2122121202212122 is an apocalyptic number.
122121202212122 is a deficient number, since it is larger than the sum of its proper divisors (61060791907750).
122121202212122 is an equidigital number, since it uses as much as digits as its factorization.
122121202212122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63600564.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 122121202212122 its reverse (221212202121221), we get a palindrome (343333404333343).
Subtracting 122121202212122 from its reverse (221212202121221), we obtain a palindrome (99090999909099).
The spelling of 122121202212122 in words is "one hundred twenty-two trillion, one hundred twenty-one billion, two hundred two million, two hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •