Base | Representation |
---|---|
bin | 100001000110010001110001… |
… | …001010010011011011010100 |
3 | 201002102001200122101212211001 |
4 | 201012101301022103123110 |
5 | 123034432033102404302 |
6 | 1233332305143353044 |
7 | 42442602141421126 |
oct | 4106216112233324 |
9 | 632361618355731 |
10 | 145566930122452 |
11 | 4242265214a893 |
12 | 143aba1a452784 |
13 | 632bb9705a987 |
14 | 27d3696cb7216 |
15 | 11c67e36a8787 |
hex | 8464712936d4 |
145566930122452 has 12 divisors (see below), whose sum is σ = 258231745902676. Its totient is φ = 71786431293120.
The previous prime is 145566930122417. The next prime is 145566930122503. The reversal of 145566930122452 is 254221039665541.
It can be written as a sum of positive squares in 2 ways, for example, as 113201003043216 + 32365927079236 = 10639596^2 + 5689106^2 .
It is a super-2 number, since 2×1455669301224522 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145566930122393 and 145566930122402.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 249258441699 + ... + 249258442282.
Almost surely, 2145566930122452 is an apocalyptic number.
It is an amenable number.
145566930122452 is a deficient number, since it is larger than the sum of its proper divisors (112664815780224).
145566930122452 is a wasteful number, since it uses less digits than its factorization.
145566930122452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 498516884058 (or 498516884056 counting only the distinct ones).
The product of its (nonzero) digits is 15552000, while the sum is 55.
Adding to 145566930122452 its reverse (254221039665541), we get a palindrome (399787969787993).
The spelling of 145566930122452 in words is "one hundred forty-five trillion, five hundred sixty-six billion, nine hundred thirty million, one hundred twenty-two thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •