Base | Representation |
---|---|
bin | 111000011111111011… |
… | …0000001011000001000 |
3 | 102121011201012022000001 |
4 | 1300333312001120020 |
5 | 3441441013212222 |
6 | 131423251252344 |
7 | 11523450525403 |
oct | 1607766013010 |
9 | 377151168001 |
10 | 121330210312 |
11 | 47501816893 |
12 | 1b6212aa0b4 |
13 | b59796bc6c |
14 | 5c2dc8cd3a |
15 | 3251b61e27 |
hex | 1c3fd81608 |
121330210312 has 16 divisors (see below), whose sum is σ = 234832665600. Its totient is φ = 58708166160.
The previous prime is 121330210291. The next prime is 121330210319. The reversal of 121330210312 is 213012033121.
It is a super-3 number, since 3×1213302103123 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 121330210312.
It is not an unprimeable number, because it can be changed into a prime (121330210319) 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 3 ways as a sum of consecutive naturals, for example, 244617112 + ... + 244617607.
It is an arithmetic number, because the mean of its divisors is an integer number (14677041600).
Almost surely, 2121330210312 is an apocalyptic number.
It is an amenable number.
121330210312 is a deficient number, since it is larger than the sum of its proper divisors (113502455288).
121330210312 is a wasteful number, since it uses less digits than its factorization.
121330210312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489234756 (or 489234752 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121330210312 its reverse (213012033121), we get a palindrome (334342243433).
The spelling of 121330210312 in words is "one hundred twenty-one billion, three hundred thirty million, two hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •