Base | Representation |
---|---|
bin | 1000011110011110111… |
… | …0000100000110001001 |
3 | 111220212121121100101112 |
4 | 2013213232010012021 |
5 | 4341213103024230 |
6 | 150521514500105 |
7 | 13343431415351 |
oct | 2074756040611 |
9 | 456777540345 |
10 | 145621533065 |
11 | 56837617138 |
12 | 24280434635 |
13 | 10969418618 |
14 | 709607db61 |
15 | 3bc44ead95 |
hex | 21e7b84189 |
145621533065 has 8 divisors (see below), whose sum is σ = 174785073480. Its totient is φ = 116471070592.
The previous prime is 145621533059. The next prime is 145621533073. The reversal of 145621533065 is 560335126541.
It can be written as a sum of positive squares in 4 ways, for example, as 34617951481 + 111003581584 = 186059^2 + 333172^2 .
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 145621533065 - 28 = 145621532809 is a prime.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 3244970 + ... + 3289539.
It is an arithmetic number, because the mean of its divisors is an integer number (21848134185).
Almost surely, 2145621533065 is an apocalyptic number.
It is an amenable number.
145621533065 is a deficient number, since it is larger than the sum of its proper divisors (29163540415).
145621533065 is an equidigital number, since it uses as much as digits as its factorization.
145621533065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6538971.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 145621533065 in words is "one hundred forty-five billion, six hundred twenty-one million, five hundred thirty-three thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •