Base | Representation |
---|---|
bin | 1000101100111001100… |
… | …1110000000110111101 |
3 | 112021212100002111101012 |
4 | 2023032121300012331 |
5 | 4422124341321323 |
6 | 152401530525005 |
7 | 13541354603606 |
oct | 2131631600675 |
9 | 467770074335 |
10 | 149491745213 |
11 | 58443213878 |
12 | 24b80596765 |
13 | 11135196c95 |
14 | 734208adad |
15 | 3d4e185678 |
hex | 22ce6701bd |
149491745213 has 2 divisors, whose sum is σ = 149491745214. Its totient is φ = 149491745212.
The previous prime is 149491745177. The next prime is 149491745233. The reversal of 149491745213 is 312547194941.
149491745213 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 can be written as a sum of positive squares in only one way, i.e., 102940230649 + 46551514564 = 320843^2 + 215758^2 .
It is a cyclic number.
It is not a de Polignac number, because 149491745213 - 216 = 149491679677 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149491745233) 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, 74745872606 + 74745872607.
It is an arithmetic number, because the mean of its divisors is an integer number (74745872607).
Almost surely, 2149491745213 is an apocalyptic number.
It is an amenable number.
149491745213 is a deficient number, since it is larger than the sum of its proper divisors (1).
149491745213 is an equidigital number, since it uses as much as digits as its factorization.
149491745213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1088640, while the sum is 50.
The spelling of 149491745213 in words is "one hundred forty-nine billion, four hundred ninety-one million, seven hundred forty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •