Base | Representation |
---|---|
bin | 11011100100011110111110… |
… | …111100101100011100111011 |
3 | 120220022210212101022121200011 |
4 | 123210132332330230130323 |
5 | 111343113030340041011 |
6 | 1105515303004522351 |
7 | 34353225460345303 |
oct | 3344367674543473 |
9 | 526283771277604 |
10 | 121254425315131 |
11 | 356a9792aa3089 |
12 | 11723b058503b7 |
13 | 528732153bb54 |
14 | 21d2a61912603 |
15 | e0418c470621 |
hex | 6e47bef2c73b |
121254425315131 has 2 divisors, whose sum is σ = 121254425315132. Its totient is φ = 121254425315130.
The previous prime is 121254425315119. The next prime is 121254425315171. The reversal of 121254425315131 is 131513524452121.
It is an a-pointer prime, because the next prime (121254425315171) can be obtained adding 121254425315131 to its sum of digits (40).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121254425315131 - 215 = 121254425282363 is a prime.
It is a super-2 number, since 2×1212544253151312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121254425315171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60627212657565 + 60627212657566.
It is an arithmetic number, because the mean of its divisors is an integer number (60627212657566).
Almost surely, 2121254425315131 is an apocalyptic number.
121254425315131 is a deficient number, since it is larger than the sum of its proper divisors (1).
121254425315131 is an equidigital number, since it uses as much as digits as its factorization.
121254425315131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 144000, while the sum is 40.
Adding to 121254425315131 its reverse (131513524452121), we get a palindrome (252767949767252).
The spelling of 121254425315131 in words is "one hundred twenty-one trillion, two hundred fifty-four billion, four hundred twenty-five million, three hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •