Base | Representation |
---|---|
bin | 100001000100010110001101… |
… | …101101001011100010011110 |
3 | 201001221101020222122110210210 |
4 | 201010112031231023202132 |
5 | 123030243333322303204 |
6 | 1233151325022313250 |
7 | 42430164444013143 |
oct | 4104261555134236 |
9 | 631841228573723 |
10 | 145434265041054 |
11 | 42381364174650 |
12 | 1438a175128826 |
13 | 631c513ca7402 |
14 | 27cb0ad8a83ca |
15 | 11c312b8ab389 |
hex | 84458db4b89e |
145434265041054 has 64 divisors (see below), whose sum is σ = 318088413573120. Its totient is φ = 43963087549920.
The previous prime is 145434265041049. The next prime is 145434265041061. The reversal of 145434265041054 is 450140562434541.
It is a super-2 number, since 2×1454342650410542 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145434265040994 and 145434265041012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 105258217 + ... + 106630955.
It is an arithmetic number, because the mean of its divisors is an integer number (4970131462080).
Almost surely, 2145434265041054 is an apocalyptic number.
145434265041054 is an abundant number, since it is smaller than the sum of its proper divisors (172654148532066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145434265041054 is a wasteful number, since it uses less digits than its factorization.
145434265041054 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1376685.
The product of its (nonzero) digits is 4608000, while the sum is 48.
The spelling of 145434265041054 in words is "one hundred forty-five trillion, four hundred thirty-four billion, two hundred sixty-five million, forty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •