Base | Representation |
---|---|
bin | 1000100100000111011… |
… | …0010001110000111011 |
3 | 112001202222220010011201 |
4 | 2021001312101300323 |
5 | 4402312202320033 |
6 | 151331532235031 |
7 | 13426052160601 |
oct | 2110166216073 |
9 | 461688803151 |
10 | 147133635643 |
11 | 57443113195 |
12 | 2462290ba77 |
13 | 10b4a787487 |
14 | 719ac13871 |
15 | 3c6213647d |
hex | 2241d91c3b |
147133635643 has 2 divisors, whose sum is σ = 147133635644. Its totient is φ = 147133635642.
The previous prime is 147133635601. The next prime is 147133635673. The reversal of 147133635643 is 346536331741.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 147133635643 - 229 = 146596764731 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 147133635593 and 147133635602.
It is not a weakly prime, because it can be changed into another prime (147133635673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73566817821 + 73566817822.
It is an arithmetic number, because the mean of its divisors is an integer number (73566817822).
Almost surely, 2147133635643 is an apocalyptic number.
147133635643 is a deficient number, since it is larger than the sum of its proper divisors (1).
147133635643 is an equidigital number, since it uses as much as digits as its factorization.
147133635643 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1632960, while the sum is 46.
The spelling of 147133635643 in words is "one hundred forty-seven billion, one hundred thirty-three million, six hundred thirty-five thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •