Base | Representation |
---|---|
bin | 100000010100001100100000… |
… | …101111010001011110111001 |
3 | 200122020001021100211100220211 |
4 | 200110030200233101132321 |
5 | 122112040114341231400 |
6 | 1222135244512151121 |
7 | 41636133503503042 |
oct | 4024144057213671 |
9 | 618201240740824 |
10 | 142125312055225 |
11 | 41316008501934 |
12 | 13b34a075384a1 |
13 | 613c489849975 |
14 | 2714c8a7b58c9 |
15 | 11670139b6dba |
hex | 814320bd17b9 |
142125312055225 has 12 divisors (see below), whose sum is σ = 176921127761724. Its totient is φ = 113257836216320.
The previous prime is 142125312055211. The next prime is 142125312055241. The reversal of 142125312055225 is 522550213521241.
It can be written as a sum of positive squares in 6 ways, for example, as 8658771171241 + 133466540883984 = 2942579^2 + 11552772^2 .
It is not a de Polignac number, because 142125312055225 - 229 = 142124775184313 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11060329144 + ... + 11060341993.
It is an arithmetic number, because the mean of its divisors is an integer number (14743427313477).
Almost surely, 2142125312055225 is an apocalyptic number.
It is an amenable number.
142125312055225 is a deficient number, since it is larger than the sum of its proper divisors (34795815706499).
142125312055225 is a wasteful number, since it uses less digits than its factorization.
142125312055225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22120671404 (or 22120671399 counting only the distinct ones).
The product of its (nonzero) digits is 240000, while the sum is 40.
Adding to 142125312055225 its reverse (522550213521241), we get a palindrome (664675525576466).
The spelling of 142125312055225 in words is "one hundred forty-two trillion, one hundred twenty-five billion, three hundred twelve million, fifty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •