Base | Representation |
---|---|
bin | 1000011101101010110… |
… | …1010100111111101011 |
3 | 111220022101211201120022 |
4 | 2013122231110333223 |
5 | 4340241212030311 |
6 | 150444115551055 |
7 | 13335141054623 |
oct | 2073255247753 |
9 | 456271751508 |
10 | 145403236331 |
11 | 56735377611 |
12 | 2421b2bb48b |
13 | 10933126262 |
14 | 7075097883 |
15 | 3bb027a5db |
hex | 21dab54feb |
145403236331 has 2 divisors, whose sum is σ = 145403236332. Its totient is φ = 145403236330.
The previous prime is 145403236327. The next prime is 145403236351. The reversal of 145403236331 is 133632304541.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145403236331 - 22 = 145403236327 is a prime.
It is a super-2 number, since 2×1454032363312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145403236291 and 145403236300.
It is not a weakly prime, because it can be changed into another prime (145403236301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72701618165 + 72701618166.
It is an arithmetic number, because the mean of its divisors is an integer number (72701618166).
Almost surely, 2145403236331 is an apocalyptic number.
145403236331 is a deficient number, since it is larger than the sum of its proper divisors (1).
145403236331 is an equidigital number, since it uses as much as digits as its factorization.
145403236331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 35.
The spelling of 145403236331 in words is "one hundred forty-five billion, four hundred three million, two hundred thirty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •