Base | Representation |
---|---|
bin | 1000101011010000000… |
… | …1110110100111001111 |
3 | 112020201111111120022102 |
4 | 2022310001312213033 |
5 | 4420223103212113 |
6 | 152250003105315 |
7 | 13524402625535 |
oct | 2126401664717 |
9 | 466644446272 |
10 | 149049272783 |
11 | 58236479784 |
12 | 24a7837223b |
13 | 11094604688 |
14 | 72dd3cc155 |
15 | 3d253d2758 |
hex | 22b40769cf |
149049272783 has 2 divisors, whose sum is σ = 149049272784. Its totient is φ = 149049272782.
The previous prime is 149049272717. The next prime is 149049272807. The reversal of 149049272783 is 387272940941.
149049272783 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 an emirp because it is prime and its reverse (387272940941) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-149049272783 is a prime.
It is a super-2 number, since 2×1490492727832 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149049272683) 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, 74524636391 + 74524636392.
It is an arithmetic number, because the mean of its divisors is an integer number (74524636392).
Almost surely, 2149049272783 is an apocalyptic number.
149049272783 is a deficient number, since it is larger than the sum of its proper divisors (1).
149049272783 is an equidigital number, since it uses as much as digits as its factorization.
149049272783 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6096384, while the sum is 56.
The spelling of 149049272783 in words is "one hundred forty-nine billion, forty-nine million, two hundred seventy-two thousand, seven hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •