Base | Representation |
---|---|
bin | 100000111111110110100110… |
… | …100010100110000111111110 |
3 | 201000211212010201110202011011 |
4 | 200333312212202212013332 |
5 | 123010213402134121304 |
6 | 1232353413020545434 |
7 | 42365652535633606 |
oct | 4077664642460776 |
9 | 630755121422134 |
10 | 145125444051454 |
11 | 4227239a8332a9 |
12 | 1433a3496b227a |
13 | 62c9369813b39 |
14 | 27ba17502bc06 |
15 | 11ba0a4ad0c04 |
hex | 83fda68a61fe |
145125444051454 has 32 divisors (see below), whose sum is σ = 234817704190080. Its totient is φ = 67046632928352.
The previous prime is 145125444051439. The next prime is 145125444051481. The reversal of 145125444051454 is 454150444521541.
It is a happy number.
It is a super-2 number, since 2×1451254440514542 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145125444051398 and 145125444051407.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63903057 + ... + 66135100.
It is an arithmetic number, because the mean of its divisors is an integer number (7338053255940).
Almost surely, 2145125444051454 is an apocalyptic number.
145125444051454 is a deficient number, since it is larger than the sum of its proper divisors (89692260138626).
145125444051454 is a wasteful number, since it uses less digits than its factorization.
145125444051454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130038904.
The product of its (nonzero) digits is 5120000, while the sum is 49.
Adding to 145125444051454 its reverse (454150444521541), we get a palindrome (599275888572995).
The spelling of 145125444051454 in words is "one hundred forty-five trillion, one hundred twenty-five billion, four hundred forty-four million, fifty-one thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •