Base | Representation |
---|---|
bin | 111000010110101101… |
… | …1101000011000011101 |
3 | 102120101011221010212121 |
4 | 1300231123220120131 |
5 | 3440322423133201 |
6 | 131332454302541 |
7 | 11513010045064 |
oct | 1605533503035 |
9 | 376334833777 |
10 | 121021302301 |
11 | 47363408709 |
12 | 1b555957a51 |
13 | b548972663 |
14 | 5c00c3b1db |
15 | 32349939a1 |
hex | 1c2d6e861d |
121021302301 has 8 divisors (see below), whose sum is σ = 122559511680. Its totient is φ = 119483250432.
The previous prime is 121021302277. The next prime is 121021302371. The reversal of 121021302301 is 103203120121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121021302301 - 213 = 121021294109 is a prime.
It is a super-2 number, since 2×1210213023012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121021302371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2774406 + ... + 2817688.
It is an arithmetic number, because the mean of its divisors is an integer number (15319938960).
Almost surely, 2121021302301 is an apocalyptic number.
It is an amenable number.
121021302301 is a deficient number, since it is larger than the sum of its proper divisors (1538209379).
121021302301 is an equidigital number, since it uses as much as digits as its factorization.
121021302301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78755.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 121021302301 its reverse (103203120121), we get a palindrome (224224422422).
The spelling of 121021302301 in words is "one hundred twenty-one billion, twenty-one million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •