Base | Representation |
---|---|
bin | 11011100101010011110010… |
… | …111111011011000010101001 |
3 | 120220112020020102212111222212 |
4 | 123211103302333123002221 |
5 | 111400030200023122304 |
6 | 1110001322023454505 |
7 | 34360303652032010 |
oct | 3345236277330251 |
9 | 526466212774885 |
10 | 121311133020329 |
11 | 3572084301934a |
12 | 11732ab0bb7435 |
13 | 528c78ab83bb5 |
14 | 21d56c1033a77 |
15 | e058aab4366e |
hex | 6e54f2fdb0a9 |
121311133020329 has 8 divisors (see below), whose sum is σ = 138987033773568. Its totient is φ = 103721666990400.
The previous prime is 121311133020317. The next prime is 121311133020373. The reversal of 121311133020329 is 923020331113121.
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 121311133020329 - 28 = 121311133020073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121311133020295 and 121311133020304.
It is not an unprimeable number, because it can be changed into a prime (121311133026329) 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, 21608677817 + ... + 21608683430.
It is an arithmetic number, because the mean of its divisors is an integer number (17373379221696).
Almost surely, 2121311133020329 is an apocalyptic number.
It is an amenable number.
121311133020329 is a deficient number, since it is larger than the sum of its proper divisors (17675900753239).
121311133020329 is an equidigital number, since it uses as much as digits as its factorization.
121311133020329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43217361655.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 121311133020329 in words is "one hundred twenty-one trillion, three hundred eleven billion, one hundred thirty-three million, twenty thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •