Base | Representation |
---|---|
bin | 100001101110011100110011… |
… | …101101001011100011101111 |
3 | 201110011222100220021221112122 |
4 | 201232130303231023203233 |
5 | 123420144322120033244 |
6 | 1243244424120023155 |
7 | 43146212200215002 |
oct | 4156346355134357 |
9 | 643158326257478 |
10 | 148327563049199 |
11 | 432974034a4586 |
12 | 14776a60901abb |
13 | 649c2c9672c11 |
14 | 288b1415d9539 |
15 | 12235188151ee |
hex | 86e733b4b8ef |
148327563049199 has 2 divisors, whose sum is σ = 148327563049200. Its totient is φ = 148327563049198.
The previous prime is 148327563049153. The next prime is 148327563049201. The reversal of 148327563049199 is 991940365723841.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 148327563049199 - 232 = 148323268081903 is a prime.
It is a super-2 number, since 2×1483275630491992 (a number of 29 digits) contains 22 as substring.
Together with 148327563049201, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (148327563049109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74163781524599 + 74163781524600.
It is an arithmetic number, because the mean of its divisors is an integer number (74163781524600).
It is a 1-persistent number, because it is pandigital, but 2⋅148327563049199 = 296655126098398 is not.
Almost surely, 2148327563049199 is an apocalyptic number.
148327563049199 is a deficient number, since it is larger than the sum of its proper divisors (1).
148327563049199 is an equidigital number, since it uses as much as digits as its factorization.
148327563049199 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 352719360, while the sum is 71.
The spelling of 148327563049199 in words is "one hundred forty-eight trillion, three hundred twenty-seven billion, five hundred sixty-three million, forty-nine thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •