Base | Representation |
---|---|
bin | 11011100000111101011011… |
… | …010011111000001001001000 |
3 | 120212110122201202110100222212 |
4 | 123200331123103320021020 |
5 | 111330131024242032102 |
6 | 1105212130432404252 |
7 | 34326563002040141 |
oct | 3340753323701110 |
9 | 525418652410885 |
10 | 121012235502152 |
11 | 35616001181a55 |
12 | 116a4b949a6688 |
13 | 526a5355947c7 |
14 | 21c50484b8ac8 |
15 | decc1515ac52 |
hex | 6e0f5b4f8248 |
121012235502152 has 8 divisors (see below), whose sum is σ = 226897941566550. Its totient is φ = 60506117751072.
The previous prime is 121012235502079. The next prime is 121012235502161. The reversal of 121012235502152 is 251205532210121.
It can be written as a sum of positive squares in only one way, i.e., 120934140964036 + 78094538116 = 10997006^2 + 279454^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1210122355021522 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7563264718877 + ... + 7563264718892.
Almost surely, 2121012235502152 is an apocalyptic number.
It is an amenable number.
121012235502152 is a deficient number, since it is larger than the sum of its proper divisors (105885706064398).
121012235502152 is a wasteful number, since it uses less digits than its factorization.
121012235502152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15126529437775 (or 15126529437771 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 121012235502152 its reverse (251205532210121), we get a palindrome (372217767712273).
The spelling of 121012235502152 in words is "one hundred twenty-one trillion, twelve billion, two hundred thirty-five million, five hundred two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •