Base | Representation |
---|---|
bin | 1000100101101111000… |
… | …0000100010110101101 |
3 | 112002220021122001121211 |
4 | 2021123300010112231 |
5 | 4404204430343334 |
6 | 151443014554421 |
7 | 13442610064303 |
oct | 2113360042655 |
9 | 462807561554 |
10 | 147568215469 |
11 | 57646457474 |
12 | 24724368a11 |
13 | 10bb98154bc |
14 | 71dc81a273 |
15 | 3c8a37aa64 |
hex | 225bc045ad |
147568215469 has 2 divisors, whose sum is σ = 147568215470. Its totient is φ = 147568215468.
The previous prime is 147568215467. The next prime is 147568215479. The reversal of 147568215469 is 964512865741.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 144998739369 + 2569476100 = 380787^2 + 50690^2 .
It is a cyclic number.
It is not a de Polignac number, because 147568215469 - 21 = 147568215467 is a prime.
It is a super-2 number, since 2×1475682154692 (a number of 23 digits) contains 22 as substring.
Together with 147568215467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (147568215467) 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, 73784107734 + 73784107735.
It is an arithmetic number, because the mean of its divisors is an integer number (73784107735).
Almost surely, 2147568215469 is an apocalyptic number.
It is an amenable number.
147568215469 is a deficient number, since it is larger than the sum of its proper divisors (1).
147568215469 is an equidigital number, since it uses as much as digits as its factorization.
147568215469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14515200, while the sum is 58.
The spelling of 147568215469 in words is "one hundred forty-seven billion, five hundred sixty-eight million, two hundred fifteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •