Base | Representation |
---|---|
bin | 11011100010100100100110… |
… | …100101001100111101101101 |
3 | 120212212020200112001000122202 |
4 | 123202210212211030331231 |
5 | 111333434421110014013 |
6 | 1105335051444551245 |
7 | 34340564230533503 |
oct | 3342444645147555 |
9 | 525766615030582 |
10 | 121123020001133 |
11 | 35658a91135827 |
12 | 117025523b2525 |
13 | 5277b0c477b97 |
14 | 21ca557950673 |
15 | e00a4b067858 |
hex | 6e292694cf6d |
121123020001133 has 8 divisors (see below), whose sum is σ = 126576852175488. Its totient is φ = 115789052270304.
The previous prime is 121123020001079. The next prime is 121123020001163. The reversal of 121123020001133 is 331100020321121.
It is a happy number.
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 121123020001133 - 212 = 121123019997037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121123020001163) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29966108816 + ... + 29966112857.
It is an arithmetic number, because the mean of its divisors is an integer number (15822106521936).
Almost surely, 2121123020001133 is an apocalyptic number.
It is an amenable number.
121123020001133 is a deficient number, since it is larger than the sum of its proper divisors (5453832174355).
121123020001133 is an equidigital number, since it uses as much as digits as its factorization.
121123020001133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59932221763.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 121123020001133 its reverse (331100020321121), we get a palindrome (452223040322254).
The spelling of 121123020001133 in words is "one hundred twenty-one trillion, one hundred twenty-three billion, twenty million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •