Base | Representation |
---|---|
bin | 111000100010101010… |
… | …1010100100001110101 |
3 | 102121102010111000002102 |
4 | 1301011111110201311 |
5 | 3442133102120201 |
6 | 131440341151445 |
7 | 11525646350300 |
oct | 1610525244165 |
9 | 377363430072 |
10 | 121422301301 |
11 | 475497a6144 |
12 | 1b6480bb585 |
13 | b5b0a73882 |
14 | 5c3c1c1b37 |
15 | 3259ca326b |
hex | 1c45554875 |
121422301301 has 12 divisors (see below), whose sum is σ = 143911379052. Its totient is φ = 102112553088.
The previous prime is 121422301283. The next prime is 121422301309. The reversal of 121422301301 is 103103224121.
It can be written as a sum of positive squares in 2 ways, for example, as 68239023076 + 53183278225 = 261226^2 + 230615^2 .
It is not a de Polignac number, because 121422301301 - 218 = 121422039157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121422301309) 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 11 ways as a sum of consecutive naturals, for example, 23374820 + ... + 23380013.
It is an arithmetic number, because the mean of its divisors is an integer number (11992614921).
Almost surely, 2121422301301 is an apocalyptic number.
It is an amenable number.
121422301301 is a deficient number, since it is larger than the sum of its proper divisors (22489077751).
121422301301 is an equidigital number, since it uses as much as digits as its factorization.
121422301301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46754900 (or 46754893 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 121422301301 its reverse (103103224121), we get a palindrome (224525525422).
The spelling of 121422301301 in words is "one hundred twenty-one billion, four hundred twenty-two million, three hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •