Base | Representation |
---|---|
bin | 1000011110000110111… |
… | …0001000010000000000 |
3 | 111220121121012222122111 |
4 | 2013201232020100000 |
5 | 4341011321334114 |
6 | 150503521345104 |
7 | 13341100062100 |
oct | 2074156102000 |
9 | 456547188574 |
10 | 145520886784 |
11 | 56795824099 |
12 | 24252798194 |
13 | 10951609900 |
14 | 7086961200 |
15 | 3bba769bc4 |
hex | 21e1b88400 |
145520886784 has 297 divisors, whose sum is σ = 369244580301. Its totient is φ = 57129246720.
The previous prime is 145520886697. The next prime is 145520886799. The reversal of 145520886784 is 487688025541.
The square root of 145520886784 is 381472.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 21526758400 + 123994128384 = 146720^2 + 352128^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1110846399 + ... + 1110846529.
Almost surely, 2145520886784 is an apocalyptic number.
145520886784 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
145520886784 is the 381472-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145520886784
145520886784 is an abundant number, since it is smaller than the sum of its proper divisors (223723693517).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145520886784 is an equidigital number, since it uses as much as digits as its factorization.
145520886784 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 322 (or 153 counting only the distinct ones).
The product of its (nonzero) digits is 17203200, while the sum is 58.
The spelling of 145520886784 in words is "one hundred forty-five billion, five hundred twenty million, eight hundred eighty-six thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •