Base | Representation |
---|---|
bin | 111000100000000000… |
… | …0110000001001100011 |
3 | 102121011220111012201221 |
4 | 1301000000300021203 |
5 | 3441442223221311 |
6 | 131423431435511 |
7 | 11523513452542 |
oct | 1610000601143 |
9 | 377156435657 |
10 | 121333023331 |
11 | 475033682a3 |
12 | 1b622225b97 |
13 | b598415480 |
14 | 5c303c2159 |
15 | 325201a671 |
hex | 1c40030263 |
121333023331 has 32 divisors (see below), whose sum is σ = 136611256320. Its totient is φ = 107028964224.
The previous prime is 121333023307. The next prime is 121333023391. The reversal of 121333023331 is 133320333121.
It is not a de Polignac number, because 121333023331 - 211 = 121333021283 is a prime.
It is a super-2 number, since 2×1213330233312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121333023296 and 121333023305.
It is not an unprimeable number, because it can be changed into a prime (121333023391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10867530 + ... + 10878688.
It is an arithmetic number, because the mean of its divisors is an integer number (4269101760).
Almost surely, 2121333023331 is an apocalyptic number.
121333023331 is a deficient number, since it is larger than the sum of its proper divisors (15278232989).
121333023331 is a wasteful number, since it uses less digits than its factorization.
121333023331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11635.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 121333023331 its reverse (133320333121), we get a palindrome (254653356452).
The spelling of 121333023331 in words is "one hundred twenty-one billion, three hundred thirty-three million, twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •