Base | Representation |
---|---|
bin | 111000011111000111… |
… | …0010110000100100101 |
3 | 102121002211001111111122 |
4 | 1300332032112010211 |
5 | 3441412034011401 |
6 | 131420440543325 |
7 | 11523000521546 |
oct | 1607616260445 |
9 | 377084044448 |
10 | 121303032101 |
11 | 47498443459 |
12 | 1b614181b45 |
13 | b592144494 |
14 | 5c2a4164cd |
15 | 324e59421b |
hex | 1c3e396125 |
121303032101 has 4 divisors (see below), whose sum is σ = 122838513600. Its totient is φ = 119767550604.
The previous prime is 121303032049. The next prime is 121303032163. The reversal of 121303032101 is 101230303121.
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 121303032101 - 210 = 121303031077 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121303032101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121303032701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 767740631 + ... + 767740788.
It is an arithmetic number, because the mean of its divisors is an integer number (30709628400).
Almost surely, 2121303032101 is an apocalyptic number.
It is an amenable number.
121303032101 is a deficient number, since it is larger than the sum of its proper divisors (1535481499).
121303032101 is an equidigital number, since it uses as much as digits as its factorization.
121303032101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1535481498.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 121303032101 its reverse (101230303121), we get a palindrome (222533335222).
The spelling of 121303032101 in words is "one hundred twenty-one billion, three hundred three million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.443 sec. • engine limits •