Base | Representation |
---|---|
bin | 11011100110110010111110… |
… | …100010110011111111101000 |
3 | 120220220000000212212212112112 |
4 | 123212302332202303333220 |
5 | 111403214001033221412 |
6 | 1110120303113301452 |
7 | 34400552362532411 |
oct | 3346627642637750 |
9 | 526800025785475 |
10 | 121413332320232 |
11 | 35760117945a77 |
12 | 1174a873404888 |
13 | 52992c720b414 |
14 | 21da6181cc808 |
15 | e0838ceac722 |
hex | 6e6cbe8b3fe8 |
121413332320232 has 64 divisors (see below), whose sum is σ = 231202666094400. Its totient is φ = 59766773253120.
The previous prime is 121413332320229. The next prime is 121413332320237. The reversal of 121413332320232 is 232023233314121.
It is a super-3 number, since 3×1214133323202323 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (121413332320237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 230436563 + ... + 230962845.
It is an arithmetic number, because the mean of its divisors is an integer number (3612541657725).
Almost surely, 2121413332320232 is an apocalyptic number.
It is an amenable number.
121413332320232 is a deficient number, since it is larger than the sum of its proper divisors (109789333774168).
121413332320232 is a wasteful number, since it uses less digits than its factorization.
121413332320232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528066 (or 528062 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 121413332320232 its reverse (232023233314121), we get a palindrome (353436565634353).
The spelling of 121413332320232 in words is "one hundred twenty-one trillion, four hundred thirteen billion, three hundred thirty-two million, three hundred twenty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •