Base | Representation |
---|---|
bin | 11011100000111110001010… |
… | …001000011001110001011001 |
3 | 120212110201202111112222110111 |
4 | 123200332022020121301121 |
5 | 111330134131340221241 |
6 | 1105212340413044321 |
7 | 34326621320621260 |
oct | 3340761210316131 |
9 | 525421674488414 |
10 | 121013021023321 |
11 | 356163746236a9 |
12 | 116a5173a866a1 |
13 | 526a62c24832b |
14 | 21c50c09555d7 |
15 | decc5e0c2c81 |
hex | 6e0f8a219c59 |
121013021023321 has 8 divisors (see below), whose sum is σ = 138334550949504. Its totient is φ = 103699979970720.
The previous prime is 121013021023243. The next prime is 121013021023327. The reversal of 121013021023321 is 123320120310121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121013021023321 - 215 = 121013020990553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121013021023292 and 121013021023301.
It is not an unprimeable number, because it can be changed into a prime (121013021023327) 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, 2122187845 + ... + 2122244866.
It is an arithmetic number, because the mean of its divisors is an integer number (17291818868688).
Almost surely, 2121013021023321 is an apocalyptic number.
It is an amenable number.
121013021023321 is a deficient number, since it is larger than the sum of its proper divisors (17321529926183).
121013021023321 is an equidigital number, since it uses as much as digits as its factorization.
121013021023321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4244436791.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 121013021023321 its reverse (123320120310121), we get a palindrome (244333141333442).
The spelling of 121013021023321 in words is "one hundred twenty-one trillion, thirteen billion, twenty-one million, twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •