Base | Representation |
---|---|
bin | 1000011100001110010… |
… | …0110111010110000101 |
3 | 111212022100120110220111 |
4 | 2013003210313112011 |
5 | 4333442334014030 |
6 | 150341413433021 |
7 | 13322416236604 |
oct | 2070344672605 |
9 | 455270513814 |
10 | 145015141765 |
11 | 565562a33aa |
12 | 2413133b771 |
13 | 108a08c28c0 |
14 | 7039711a3b |
15 | 3b8b16962a |
hex | 21c3937585 |
145015141765 has 32 divisors (see below), whose sum is σ = 190103760000. Its totient is φ = 105556488960.
The previous prime is 145015141723. The next prime is 145015141771. The reversal of 145015141765 is 567141510541.
It is a de Polignac number, because none of the positive numbers 2k-145015141765 is a prime.
It is a super-2 number, since 2×1450151417652 (a number of 23 digits) contains 22 as substring.
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, 1211586 + ... + 1325884.
It is an arithmetic number, because the mean of its divisors is an integer number (5940742500).
Almost surely, 2145015141765 is an apocalyptic number.
It is an amenable number.
145015141765 is a deficient number, since it is larger than the sum of its proper divisors (45088618235).
145015141765 is a wasteful number, since it uses less digits than its factorization.
145015141765 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114597.
The product of its (nonzero) digits is 84000, while the sum is 40.
The spelling of 145015141765 in words is "one hundred forty-five billion, fifteen million, one hundred forty-one thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •