Base | Representation |
---|---|
bin | 100001001000101101011110… |
… | …111101100000101010100001 |
3 | 201010000001020222122200011212 |
4 | 201020231132331200222201 |
5 | 123100201443344102312 |
6 | 1233541200121115505 |
7 | 42460641363255644 |
oct | 4110553675405241 |
9 | 633001228580155 |
10 | 145734128503457 |
11 | 4248755129415a |
12 | 14418300928b95 |
13 | 634189173b930 |
14 | 27db7d8827a5b |
15 | 11cad2c099822 |
hex | 848b5ef60aa1 |
145734128503457 has 16 divisors (see below), whose sum is σ = 166177622096640. Its totient is φ = 126609769558272.
The previous prime is 145734128503441. The next prime is 145734128503499. The reversal of 145734128503457 is 754305821437541.
It is not a de Polignac number, because 145734128503457 - 24 = 145734128503441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145734128503396 and 145734128503405.
It is not an unprimeable number, because it can be changed into a prime (145734128503417) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30815894 + ... + 35229072.
It is an arithmetic number, because the mean of its divisors is an integer number (10386101381040).
Almost surely, 2145734128503457 is an apocalyptic number.
145734128503457 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
145734128503457 is a deficient number, since it is larger than the sum of its proper divisors (20443493593183).
145734128503457 is a wasteful number, since it uses less digits than its factorization.
145734128503457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4562632.
The product of its (nonzero) digits is 56448000, while the sum is 59.
The spelling of 145734128503457 in words is "one hundred forty-five trillion, seven hundred thirty-four billion, one hundred twenty-eight million, five hundred three thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •