Base | Representation |
---|---|
bin | 111000011001011101… |
… | …0001100110101110001 |
3 | 102120121120212010121101 |
4 | 1300302322030311301 |
5 | 3441014434431113 |
6 | 131345540124401 |
7 | 11515204142245 |
oct | 1606272146561 |
9 | 376546763541 |
10 | 121113202033 |
11 | 474002772aa |
12 | 1b580696701 |
13 | b561a0b1b5 |
14 | 5c0d120425 |
15 | 323ca982dd |
hex | 1c32e8cd71 |
121113202033 has 8 divisors (see below), whose sum is σ = 124477921152. Its totient is φ = 117781309776.
The previous prime is 121113202013. The next prime is 121113202057. The reversal of 121113202033 is 330202311121.
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 121113202033 - 229 = 120576331121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121113202033.
It is not an unprimeable number, because it can be changed into a prime (121113202013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8199235 + ... + 8213992.
It is an arithmetic number, because the mean of its divisors is an integer number (15559740144).
Almost surely, 2121113202033 is an apocalyptic number.
It is an amenable number.
121113202033 is a deficient number, since it is larger than the sum of its proper divisors (3364719119).
121113202033 is a wasteful number, since it uses less digits than its factorization.
121113202033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16413431.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121113202033 its reverse (330202311121), we get a palindrome (451315513154).
The spelling of 121113202033 in words is "one hundred twenty-one billion, one hundred thirteen million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •