Base | Representation |
---|---|
bin | 11011100001001111001100… |
… | …010000000101010010010001 |
3 | 120212112110222002212112001122 |
4 | 123201033030100011102101 |
5 | 111330434110402431001 |
6 | 1105225003305412025 |
7 | 34331136460233023 |
oct | 3341171420052221 |
9 | 525473862775048 |
10 | 121031310202001 |
11 | 356230aa369301 |
12 | 116a8818a9a015 |
13 | 526c285358054 |
14 | 21c5d3793a013 |
15 | ded47ea4db1b |
hex | 6e13cc405491 |
121031310202001 has 8 divisors (see below), whose sum is σ = 121099650542208. Its totient is φ = 120962983680000.
The previous prime is 121031310201961. The next prime is 121031310202013. The reversal of 121031310202001 is 100202013130121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121031310202001 - 222 = 121031306007697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121031310202051) 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, 14093201 + ... + 20992401.
It is an arithmetic number, because the mean of its divisors is an integer number (15137456317776).
Almost surely, 2121031310202001 is an apocalyptic number.
It is an amenable number.
121031310202001 is a deficient number, since it is larger than the sum of its proper divisors (68340340207).
121031310202001 is an equidigital number, since it uses as much as digits as its factorization.
121031310202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6909103.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121031310202001 its reverse (100202013130121), we get a palindrome (221233323332122).
The spelling of 121031310202001 in words is "one hundred twenty-one trillion, thirty-one billion, three hundred ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •