Base | Representation |
---|---|
bin | 111000011100101101… |
… | …0000111010100000101 |
3 | 102120220012000101122102 |
4 | 1300321122013110011 |
5 | 3441230342400201 |
6 | 131404433041445 |
7 | 11520666651653 |
oct | 1607132072405 |
9 | 376805011572 |
10 | 121222231301 |
11 | 47456875636 |
12 | 1b5b10b6285 |
13 | b57b493762 |
14 | 5c1d7c1dd3 |
15 | 324743326b |
hex | 1c39687505 |
121222231301 has 4 divisors (see below), whose sum is σ = 122399146272. Its totient is φ = 120045316332.
The previous prime is 121222231297. The next prime is 121222231307. The reversal of 121222231301 is 103132222121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121222231301 - 22 = 121222231297 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 (121222231307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 588457331 + ... + 588457536.
It is an arithmetic number, because the mean of its divisors is an integer number (30599786568).
Almost surely, 2121222231301 is an apocalyptic number.
It is an amenable number.
121222231301 is a deficient number, since it is larger than the sum of its proper divisors (1176914971).
121222231301 is a wasteful number, since it uses less digits than its factorization.
121222231301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1176914970.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 121222231301 its reverse (103132222121), we get a palindrome (224354453422).
The spelling of 121222231301 in words is "one hundred twenty-one billion, two hundred twenty-two million, two hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •