Base | Representation |
---|---|
bin | 100001101011010111000010… |
… | …110101100011001111111101 |
3 | 201102102200021001220012210011 |
4 | 201223113002311203033331 |
5 | 123403204430300123402 |
6 | 1243003105122143221 |
7 | 43124654062233466 |
oct | 4153270265431775 |
9 | 642380231805704 |
10 | 148115216020477 |
11 | 432153460a6a12 |
12 | 1474187a1b1b11 |
13 | 64852883365b4 |
14 | 2880b597a3d6d |
15 | 121cc3b421ed7 |
hex | 86b5c2d633fd |
148115216020477 has 2 divisors, whose sum is σ = 148115216020478. Its totient is φ = 148115216020476.
The previous prime is 148115216020469. The next prime is 148115216020531. The reversal of 148115216020477 is 774020612511841.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120545775083556 + 27569440936921 = 10979334^2 + 5250661^2 .
It is a cyclic number.
It is not a de Polignac number, because 148115216020477 - 23 = 148115216020469 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 148115216020477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (148115213020477) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74057608010238 + 74057608010239.
It is an arithmetic number, because the mean of its divisors is an integer number (74057608010239).
Almost surely, 2148115216020477 is an apocalyptic number.
It is an amenable number.
148115216020477 is a deficient number, since it is larger than the sum of its proper divisors (1).
148115216020477 is an equidigital number, since it uses as much as digits as its factorization.
148115216020477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 752640, while the sum is 49.
The spelling of 148115216020477 in words is "one hundred forty-eight trillion, one hundred fifteen billion, two hundred sixteen million, twenty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •