Base | Representation |
---|---|
bin | 1000100111110000110… |
… | …1000111011001100011 |
3 | 112011022020011210101121 |
4 | 2021330031013121203 |
5 | 4411313322413102 |
6 | 152013025113111 |
7 | 13462241120614 |
oct | 2117415073143 |
9 | 464266153347 |
10 | 148112701027 |
11 | 578a5838535 |
12 | 24856788797 |
13 | 10c755749c5 |
14 | 7250c71c0b |
15 | 3cbd07eb37 |
hex | 227c347663 |
148112701027 has 2 divisors, whose sum is σ = 148112701028. Its totient is φ = 148112701026.
The previous prime is 148112700943. The next prime is 148112701039. The reversal of 148112701027 is 720107211841.
It is a happy number.
148112701027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 148112701027 - 227 = 147978483299 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 148112700983 and 148112701001.
It is not a weakly prime, because it can be changed into another prime (148112701427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74056350513 + 74056350514.
It is an arithmetic number, because the mean of its divisors is an integer number (74056350514).
Almost surely, 2148112701027 is an apocalyptic number.
148112701027 is a deficient number, since it is larger than the sum of its proper divisors (1).
148112701027 is an equidigital number, since it uses as much as digits as its factorization.
148112701027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6272, while the sum is 34.
Adding to 148112701027 its reverse (720107211841), we get a palindrome (868219912868).
The spelling of 148112701027 in words is "one hundred forty-eight billion, one hundred twelve million, seven hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •