Base | Representation |
---|---|
bin | 1000101000011011010… |
… | …0000101111000100111 |
3 | 112011202122002121011222 |
4 | 2022012310011320213 |
5 | 4412144404044344 |
6 | 152042424050555 |
7 | 13466532033632 |
oct | 2120664057047 |
9 | 464678077158 |
10 | 148290690599 |
11 | 57987257757 |
12 | 248a6303a5b |
13 | 10ca33c378c |
14 | 726a764c19 |
15 | 3ccd9dc5ee |
hex | 2286d05e27 |
148290690599 has 2 divisors, whose sum is σ = 148290690600. Its totient is φ = 148290690598.
The previous prime is 148290690557. The next prime is 148290690601. The reversal of 148290690599 is 995096092841.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 148290690599 - 232 = 143995723303 is a prime.
Together with 148290690601, 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 (148290690299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74145345299 + 74145345300.
It is an arithmetic number, because the mean of its divisors is an integer number (74145345300).
Almost surely, 2148290690599 is an apocalyptic number.
148290690599 is a deficient number, since it is larger than the sum of its proper divisors (1).
148290690599 is an equidigital number, since it uses as much as digits as its factorization.
148290690599 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12597120, while the sum is 62.
The spelling of 148290690599 in words is "one hundred forty-eight billion, two hundred ninety million, six hundred ninety thousand, five hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •