Base | Representation |
---|---|
bin | 1000011110010011011… |
… | …0010110111000011001 |
3 | 111220202020222200122111 |
4 | 2013210312112320121 |
5 | 4341113241004023 |
6 | 150513034352321 |
7 | 13342305163336 |
oct | 2074466267031 |
9 | 456666880574 |
10 | 145573375513 |
11 | 56812414705 |
12 | 2426828b6a1 |
13 | 1095c456a27 |
14 | 708d90598d |
15 | 3bc018700d |
hex | 21e4d96e19 |
145573375513 has 2 divisors, whose sum is σ = 145573375514. Its totient is φ = 145573375512.
The previous prime is 145573375511. The next prime is 145573375547. The reversal of 145573375513 is 315573375541.
145573375513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97501936009 + 48071439504 = 312253^2 + 219252^2 .
It is a cyclic number.
It is not a de Polignac number, because 145573375513 - 21 = 145573375511 is a prime.
Together with 145573375511, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (145573375511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72786687756 + 72786687757.
It is an arithmetic number, because the mean of its divisors is an integer number (72786687757).
Almost surely, 2145573375513 is an apocalyptic number.
It is an amenable number.
145573375513 is a deficient number, since it is larger than the sum of its proper divisors (1).
145573375513 is an equidigital number, since it uses as much as digits as its factorization.
145573375513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3307500, while the sum is 49.
The spelling of 145573375513 in words is "one hundred forty-five billion, five hundred seventy-three million, three hundred seventy-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •