Base | Representation |
---|---|
bin | 100001000011010001011100… |
… | …011001000000100011010001 |
3 | 201001200022122211020120211012 |
4 | 201003101130121000203101 |
5 | 123023041121321204203 |
6 | 1233053353452100305 |
7 | 42421641536645204 |
oct | 4103213431004321 |
9 | 631608584216735 |
10 | 145360423225553 |
11 | 42353011410748 |
12 | 143779a7764695 |
13 | 6315576944663 |
14 | 27c76a695793b |
15 | 11c1258d6ebd8 |
hex | 84345c6408d1 |
145360423225553 has 16 divisors (see below), whose sum is σ = 155443465207296. Its totient is φ = 135593738396160.
The previous prime is 145360423225403. The next prime is 145360423225601. The reversal of 145360423225553 is 355522324063541.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 145360423225553 - 222 = 145360419031249 is a prime.
It is a super-2 number, since 2×1453604232255532 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145360473225553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29189576 + ... + 33804617.
It is an arithmetic number, because the mean of its divisors is an integer number (9715216575456).
Almost surely, 2145360423225553 is an apocalyptic number.
It is an amenable number.
145360423225553 is a deficient number, since it is larger than the sum of its proper divisors (10083041981743).
145360423225553 is a wasteful number, since it uses less digits than its factorization.
145360423225553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62996704.
The product of its (nonzero) digits is 12960000, while the sum is 50.
The spelling of 145360423225553 in words is "one hundred forty-five trillion, three hundred sixty billion, four hundred twenty-three million, two hundred twenty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •