Base | Representation |
---|---|
bin | 111000011101000010… |
… | …0011101000010011011 |
3 | 102120220221220021122121 |
4 | 1300322010131002123 |
5 | 3441241213032311 |
6 | 131405511002111 |
7 | 11521163206441 |
oct | 1607204350233 |
9 | 376827807577 |
10 | 121233330331 |
11 | 47462066493 |
12 | 1b5b4969337 |
13 | b58087b629 |
14 | 5c21070b91 |
15 | 32483c6b71 |
hex | 1c3a11d09b |
121233330331 has 16 divisors (see below), whose sum is σ = 125753990400. Its totient is φ = 116799871968.
The previous prime is 121233330311. The next prime is 121233330371. The reversal of 121233330331 is 133033332121.
It is a cyclic number.
It is not a de Polignac number, because 121233330331 - 213 = 121233322139 is a prime.
It is a super-2 number, since 2×1212333303312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121233330296 and 121233330305.
It is not an unprimeable number, because it can be changed into a prime (121233330311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2852620 + ... + 2894806.
It is an arithmetic number, because the mean of its divisors is an integer number (7859624400).
Almost surely, 2121233330331 is an apocalyptic number.
121233330331 is a deficient number, since it is larger than the sum of its proper divisors (4520660069).
121233330331 is an equidigital number, since it uses as much as digits as its factorization.
121233330331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43218.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 121233330331 its reverse (133033332121), we get a palindrome (254266662452).
The spelling of 121233330331 in words is "one hundred twenty-one billion, two hundred thirty-three million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •