Base | Representation |
---|---|
bin | 11011100011110101100111… |
… | …001100001110110111101101 |
3 | 120220011120012112111110122101 |
4 | 123203311213030032313231 |
5 | 111341401041322222201 |
6 | 1105443035023215101 |
7 | 34350063606541300 |
oct | 3343654714166755 |
9 | 526146175443571 |
10 | 121210003320301 |
11 | 35691967a32965 |
12 | 11717388a47491 |
13 | 52830922c51cc |
14 | 21d0849d42b37 |
15 | e02e3c657d01 |
hex | 6e3d6730eded |
121210003320301 has 48 divisors (see below), whose sum is σ = 142541190414336. Its totient is φ = 102763672510464.
The previous prime is 121210003320293. The next prime is 121210003320311. The reversal of 121210003320301 is 103023300012121.
It is not a de Polignac number, because 121210003320301 - 23 = 121210003320293 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121210003320311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2768783725 + ... + 2768827501.
It is an arithmetic number, because the mean of its divisors is an integer number (2969608133632).
Almost surely, 2121210003320301 is an apocalyptic number.
It is an amenable number.
121210003320301 is a deficient number, since it is larger than the sum of its proper divisors (21331187094035).
121210003320301 is a wasteful number, since it uses less digits than its factorization.
121210003320301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45258 (or 45251 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121210003320301 its reverse (103023300012121), we get a palindrome (224233303332422).
The spelling of 121210003320301 in words is "one hundred twenty-one trillion, two hundred ten billion, three million, three hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •