Base | Representation |
---|---|
bin | 100001100010101101101100… |
… | …110010100101011001111001 |
3 | 201100022212122210112102022201 |
4 | 201202231230302211121321 |
5 | 123313441121112243244 |
6 | 1241430124220550201 |
7 | 43034021363202343 |
oct | 4142555462453171 |
9 | 640285583472281 |
10 | 147521066915449 |
11 | 43006373453407 |
12 | 146666a29b2361 |
13 | 644123b8ca426 |
14 | 28600b45d8293 |
15 | 120c565087ad4 |
hex | 862b6cca5679 |
147521066915449 has 2 divisors, whose sum is σ = 147521066915450. Its totient is φ = 147521066915448.
The previous prime is 147521066915407. The next prime is 147521066915569. The reversal of 147521066915449 is 944519660125741.
147521066915449 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104587540508025 + 42933526407424 = 10226805^2 + 6552368^2 .
It is a cyclic number.
It is not a de Polignac number, because 147521066915449 - 211 = 147521066913401 is a prime.
It is not a weakly prime, because it can be changed into another prime (147521066915149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73760533457724 + 73760533457725.
It is an arithmetic number, because the mean of its divisors is an integer number (73760533457725).
Almost surely, 2147521066915449 is an apocalyptic number.
It is an amenable number.
147521066915449 is a deficient number, since it is larger than the sum of its proper divisors (1).
147521066915449 is an equidigital number, since it uses as much as digits as its factorization.
147521066915449 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 65318400, while the sum is 64.
The spelling of 147521066915449 in words is "one hundred forty-seven trillion, five hundred twenty-one billion, sixty-six million, nine hundred fifteen thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •