Base | Representation |
---|---|
bin | 11100000101100111001110… |
… | …101010000011011111110001 |
3 | 121012101110011021202002021011 |
4 | 130011213032222003133301 |
5 | 112142413013002443441 |
6 | 1114421211242430521 |
7 | 35006551605034411 |
oct | 3405471652033761 |
9 | 535343137662234 |
10 | 123531021531121 |
11 | 363a7237230906 |
12 | 11a31181202441 |
13 | 53c0c04ca7bc9 |
14 | 2270d0d148641 |
15 | e434d313c581 |
hex | 7059cea837f1 |
123531021531121 has 2 divisors, whose sum is σ = 123531021531122. Its totient is φ = 123531021531120.
The previous prime is 123531021531119. The next prime is 123531021531133. The reversal of 123531021531121 is 121135120135321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92702986241121 + 30828035290000 = 9628239^2 + 5552300^2 .
It is a cyclic number.
It is not a de Polignac number, because 123531021531121 - 21 = 123531021531119 is a prime.
Together with 123531021531119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (123531021531721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61765510765560 + 61765510765561.
It is an arithmetic number, because the mean of its divisors is an integer number (61765510765561).
Almost surely, 2123531021531121 is an apocalyptic number.
It is an amenable number.
123531021531121 is a deficient number, since it is larger than the sum of its proper divisors (1).
123531021531121 is an equidigital number, since it uses as much as digits as its factorization.
123531021531121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
Adding to 123531021531121 its reverse (121135120135321), we get a palindrome (244666141666442).
The spelling of 123531021531121 in words is "one hundred twenty-three trillion, five hundred thirty-one billion, twenty-one million, five hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •