Base | Representation |
---|---|
bin | 1000011100100110001… |
… | …1000011101101111101 |
3 | 111212120100002122022200 |
4 | 2013021203003231331 |
5 | 4334144011101303 |
6 | 150355353102113 |
7 | 13325043652041 |
oct | 2071143035575 |
9 | 455510078280 |
10 | 145115331453 |
11 | 565a79043a4 |
12 | 2415a9b7939 |
13 | 108b85a1841 |
14 | 7048b52021 |
15 | 3b94d5a3a3 |
hex | 21c98c3b7d |
145115331453 has 6 divisors (see below), whose sum is σ = 209611034334. Its totient is φ = 96743554296.
The previous prime is 145115331401. The next prime is 145115331467. The reversal of 145115331453 is 354133511541.
145115331453 is a `hidden beast` number, since 1 + 4 + 51 + 153 + 3 + 1 + 453 = 666.
It can be written as a sum of positive squares in only one way, i.e., 140881616964 + 4233714489 = 375342^2 + 65067^2 .
It is not a de Polignac number, because 145115331453 - 213 = 145115323261 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145115331253) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8061962850 + ... + 8061962867.
It is an arithmetic number, because the mean of its divisors is an integer number (34935172389).
Almost surely, 2145115331453 is an apocalyptic number.
It is an amenable number.
145115331453 is a deficient number, since it is larger than the sum of its proper divisors (64495702881).
145115331453 is a wasteful number, since it uses less digits than its factorization.
145115331453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16123925723 (or 16123925720 counting only the distinct ones).
The product of its digits is 54000, while the sum is 36.
Adding to 145115331453 its reverse (354133511541), we get a palindrome (499248842994).
The spelling of 145115331453 in words is "one hundred forty-five billion, one hundred fifteen million, three hundred thirty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •