Base | Representation |
---|---|
bin | 111000011101000101… |
… | …0111001111001101101 |
3 | 102120221002002012101120 |
4 | 1300322022321321231 |
5 | 3441242131141141 |
6 | 131410011131153 |
7 | 11521213451643 |
oct | 1607212717155 |
9 | 376832065346 |
10 | 121235021421 |
11 | 47463010a88 |
12 | 1b5b5443ab9 |
13 | b581021287 |
14 | 5c21391193 |
15 | 324860cc66 |
hex | 1c3a2b9e6d |
121235021421 has 4 divisors (see below), whose sum is σ = 161646695232. Its totient is φ = 80823347612.
The previous prime is 121235021351. The next prime is 121235021489. The reversal of 121235021421 is 124120532121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121235021421 - 27 = 121235021293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121235021391 and 121235021400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121235021491) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20205836901 + ... + 20205836906.
It is an arithmetic number, because the mean of its divisors is an integer number (40411673808).
Almost surely, 2121235021421 is an apocalyptic number.
It is an amenable number.
121235021421 is a deficient number, since it is larger than the sum of its proper divisors (40411673811).
121235021421 is an equidigital number, since it uses as much as digits as its factorization.
121235021421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40411673810.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 121235021421 its reverse (124120532121), we get a palindrome (245355553542).
The spelling of 121235021421 in words is "one hundred twenty-one billion, two hundred thirty-five million, twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •