Base | Representation |
---|---|
bin | 11011100101001100001110… |
… | …010111010001000001110011 |
3 | 120220111110020210112012100002 |
4 | 123211030032113101001303 |
5 | 111344412022043233021 |
6 | 1105553455134420215 |
7 | 34356565323156200 |
oct | 3345141627210163 |
9 | 526443223465302 |
10 | 121303002321011 |
11 | 357183504a1635 |
12 | 1173140206166b |
13 | 528ba9353bc04 |
14 | 21d514d266ca7 |
15 | e05581e2c50b |
hex | 6e530e5d1073 |
121303002321011 has 48 divisors (see below), whose sum is σ = 145264024620000. Its totient is φ = 100942191286272.
The previous prime is 121303002320999. The next prime is 121303002321019. The reversal of 121303002321011 is 110123200303121.
It is a happy number.
It is not a de Polignac number, because 121303002321011 - 26 = 121303002320947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121303002321019) 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 47 ways as a sum of consecutive naturals, for example, 279122615 + ... + 279556863.
It is an arithmetic number, because the mean of its divisors is an integer number (3026333846250).
Almost surely, 2121303002321011 is an apocalyptic number.
121303002321011 is a deficient number, since it is larger than the sum of its proper divisors (23961022298989).
121303002321011 is a wasteful number, since it uses less digits than its factorization.
121303002321011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435108 (or 435101 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 121303002321011 its reverse (110123200303121), we get a palindrome (231426202624132).
The spelling of 121303002321011 in words is "one hundred twenty-one trillion, three hundred three billion, two million, three hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •