Base | Representation |
---|---|
bin | 1000011101011100111… |
… | …1011001111010111001 |
3 | 111220011100101002101021 |
4 | 2013113033121322321 |
5 | 4340131313414122 |
6 | 150434241022441 |
7 | 13333533426115 |
oct | 2072717317271 |
9 | 456140332337 |
10 | 145345060537 |
11 | 56705552246 |
12 | 24203924a21 |
13 | 10924067701 |
14 | 706b472745 |
15 | 3baa0d81c7 |
hex | 21d73d9eb9 |
145345060537 has 8 divisors (see below), whose sum is σ = 145440196160. Its totient is φ = 145249962480.
The previous prime is 145345060507. The next prime is 145345060583. The reversal of 145345060537 is 735060543541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145345060537 - 27 = 145345060409 is a prime.
It is a super-2 number, since 2×1453450605372 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145345060493 and 145345060502.
It is not an unprimeable number, because it can be changed into a prime (145345060507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12383962 + ... + 12395692.
It is an arithmetic number, because the mean of its divisors is an integer number (18180024520).
Almost surely, 2145345060537 is an apocalyptic number.
It is an amenable number.
145345060537 is a deficient number, since it is larger than the sum of its proper divisors (95135623).
145345060537 is a wasteful number, since it uses less digits than its factorization.
145345060537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18783.
The product of its (nonzero) digits is 756000, while the sum is 43.
The spelling of 145345060537 in words is "one hundred forty-five billion, three hundred forty-five million, sixty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •