Base | Representation |
---|---|
bin | 100001101010000001111110… |
… | …010000001110011010010101 |
3 | 201102002221111002021001001022 |
4 | 201222001332100032122111 |
5 | 123400210341443300033 |
6 | 1242453121055010525 |
7 | 43115241342051155 |
oct | 4152017620163225 |
9 | 642087432231038 |
10 | 148023871071893 |
11 | 4318a631278073 |
12 | 14728026b09a45 |
13 | 647978b99c26b |
14 | 287a572004765 |
15 | 121a691e77098 |
hex | 86a07e40e695 |
148023871071893 has 2 divisors, whose sum is σ = 148023871071894. Its totient is φ = 148023871071892.
The previous prime is 148023871071821. The next prime is 148023871071913. The reversal of 148023871071893 is 398170178320841.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114723100326769 + 33300770745124 = 10710887^2 + 5770682^2 .
It is a cyclic number.
It is not a de Polignac number, because 148023871071893 - 210 = 148023871070869 is a prime.
It is a super-2 number, since 2×1480238710718932 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (148023871011893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74011935535946 + 74011935535947.
It is an arithmetic number, because the mean of its divisors is an integer number (74011935535947).
Almost surely, 2148023871071893 is an apocalyptic number.
It is an amenable number.
148023871071893 is a deficient number, since it is larger than the sum of its proper divisors (1).
148023871071893 is an equidigital number, since it uses as much as digits as its factorization.
148023871071893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16257024, while the sum is 62.
The spelling of 148023871071893 in words is "one hundred forty-eight trillion, twenty-three billion, eight hundred seventy-one million, seventy-one thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •