Base | Representation |
---|---|
bin | 1000101011000010010… |
… | …1111011000111000111 |
3 | 112020120111000110220122 |
4 | 2022300211323013013 |
5 | 4420113323311102 |
6 | 152240143252155 |
7 | 13523102604332 |
oct | 2126045730707 |
9 | 466514013818 |
10 | 148991619527 |
11 | 58206980a63 |
12 | 24a60baa05b |
13 | 1108569991a |
14 | 72d58a1619 |
15 | 3d202e50a2 |
hex | 22b097b1c7 |
148991619527 has 2 divisors, whose sum is σ = 148991619528. Its totient is φ = 148991619526.
The previous prime is 148991619503. The next prime is 148991619529. The reversal of 148991619527 is 725916199841.
It is a happy number.
148991619527 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 148991619527 - 212 = 148991615431 is a prime.
Together with 148991619529, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 148991619527.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (148991619529) 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, 74495809763 + 74495809764.
It is an arithmetic number, because the mean of its divisors is an integer number (74495809764).
Almost surely, 2148991619527 is an apocalyptic number.
148991619527 is a deficient number, since it is larger than the sum of its proper divisors (1).
148991619527 is an equidigital number, since it uses as much as digits as its factorization.
148991619527 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9797760, while the sum is 62.
The spelling of 148991619527 in words is "one hundred forty-eight billion, nine hundred ninety-one million, six hundred nineteen thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •