Base | Representation |
---|---|
bin | 11011110101001010111010… |
… | …011001110100001110110101 |
3 | 121001101102122111001220011011 |
4 | 123311022322121310032311 |
5 | 112020404430431044000 |
6 | 1112154142545112221 |
7 | 34532121331562035 |
oct | 3365127231641665 |
9 | 531342574056134 |
10 | 122401105331125 |
11 | 36001020a72a95 |
12 | 1188a1a2628671 |
13 | 533b4b42c875a |
14 | 223236080b8c5 |
15 | e23e010b72ba |
hex | 6f52ba6743b5 |
122401105331125 has 8 divisors (see below), whose sum is σ = 152756579453400. Its totient is φ = 97920884264800.
The previous prime is 122401105331069. The next prime is 122401105331159. The reversal of 122401105331125 is 521133501104221.
It can be written as a sum of positive squares in 4 ways, for example, as 2915371842916 + 119485733488209 = 1707446^2 + 10930953^2 .
It is not a de Polignac number, because 122401105331125 - 215 = 122401105298357 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489604421200 + ... + 489604421449.
It is an arithmetic number, because the mean of its divisors is an integer number (19094572431675).
Almost surely, 2122401105331125 is an apocalyptic number.
It is an amenable number.
122401105331125 is a deficient number, since it is larger than the sum of its proper divisors (30355474122275).
122401105331125 is an frugal number, since it uses more digits than its factorization.
122401105331125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979208842664 (or 979208842654 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 122401105331125 its reverse (521133501104221), we get a palindrome (643534606435346).
The spelling of 122401105331125 in words is "one hundred twenty-two trillion, four hundred one billion, one hundred five million, three hundred thirty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •