Base | Representation |
---|---|
bin | 1000011100001010110… |
… | …0010000011111000101 |
3 | 111212021022122120022022 |
4 | 2013002230100133011 |
5 | 4333430034140113 |
6 | 150340123412525 |
7 | 13322146143542 |
oct | 2070254203705 |
9 | 455238576268 |
10 | 145000302533 |
11 | 56548988479 |
12 | 24128384145 |
13 | 1089a7c84a8 |
14 | 703776bbc9 |
15 | 3b89bd7908 |
hex | 21c2b107c5 |
145000302533 has 4 divisors (see below), whose sum is σ = 145001132460. Its totient is φ = 144999472608.
The previous prime is 145000302509. The next prime is 145000302541. The reversal of 145000302533 is 335203000541.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 335203000541 = 4507 ⋅74373863.
It can be written as a sum of positive squares in 2 ways, for example, as 70688452129 + 74311850404 = 265873^2 + 272602^2 .
It is a cyclic number.
It is not a de Polignac number, because 145000302533 - 212 = 145000298437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145000302583) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39878 + ... + 539991.
It is an arithmetic number, because the mean of its divisors is an integer number (36250283115).
Almost surely, 2145000302533 is an apocalyptic number.
It is an amenable number.
145000302533 is a deficient number, since it is larger than the sum of its proper divisors (829927).
145000302533 is an equidigital number, since it uses as much as digits as its factorization.
145000302533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 829926.
The product of its (nonzero) digits is 5400, while the sum is 26.
The spelling of 145000302533 in words is "one hundred forty-five billion, three hundred two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •