Base | Representation |
---|---|
bin | 1000011100010101001… |
… | …1001001110101010101 |
3 | 111212101100222100010022 |
4 | 2013011103021311111 |
5 | 4334022234201313 |
6 | 150344325234525 |
7 | 13323220053104 |
oct | 2070523116525 |
9 | 455340870108 |
10 | 145044053333 |
11 | 56570650063 |
12 | 2413ab62a45 |
13 | 108a68a633a |
14 | 703d4ba03b |
15 | 3b8d97ac08 |
hex | 21c54c9d55 |
145044053333 has 2 divisors, whose sum is σ = 145044053334. Its totient is φ = 145044053332.
The previous prime is 145044053321. The next prime is 145044053417. The reversal of 145044053333 is 333350440541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124134314929 + 20909738404 = 352327^2 + 144602^2 .
It is a cyclic number.
It is not a de Polignac number, because 145044053333 - 26 = 145044053269 is a prime.
It is a super-2 number, since 2×1450440533332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145044053293 and 145044053302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145044053633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72522026666 + 72522026667.
It is an arithmetic number, because the mean of its divisors is an integer number (72522026667).
Almost surely, 2145044053333 is an apocalyptic number.
It is an amenable number.
145044053333 is a deficient number, since it is larger than the sum of its proper divisors (1).
145044053333 is an equidigital number, since it uses as much as digits as its factorization.
145044053333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 129600, while the sum is 35.
Adding to 145044053333 its reverse (333350440541), we get a palindrome (478394493874).
The spelling of 145044053333 in words is "one hundred forty-five billion, forty-four million, fifty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •