Base | Representation |
---|---|
bin | 1000101011001010010… |
… | …1101111011001111101 |
3 | 112020122211001210011121 |
4 | 2022302211233121331 |
5 | 4420200413013023 |
6 | 152243341350541 |
7 | 13523660446021 |
oct | 2126245573175 |
9 | 466584053147 |
10 | 149025126013 |
11 | 58223886975 |
12 | 24a70268451 |
13 | 1108c5cb94a |
14 | 72da104381 |
15 | 3d23212d5d |
hex | 22b296f67d |
149025126013 has 2 divisors, whose sum is σ = 149025126014. Its totient is φ = 149025126012.
The previous prime is 149025125993. The next prime is 149025126023. The reversal of 149025126013 is 310621520941.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 148716667044 + 308458969 = 385638^2 + 17563^2 .
It is a cyclic number.
It is not a de Polignac number, because 149025126013 - 213 = 149025117821 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 149025126013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149025126023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74512563006 + 74512563007.
It is an arithmetic number, because the mean of its divisors is an integer number (74512563007).
Almost surely, 2149025126013 is an apocalyptic number.
It is an amenable number.
149025126013 is a deficient number, since it is larger than the sum of its proper divisors (1).
149025126013 is an equidigital number, since it uses as much as digits as its factorization.
149025126013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 34.
Adding to 149025126013 its reverse (310621520941), we get a palindrome (459646646954).
The spelling of 149025126013 in words is "one hundred forty-nine billion, twenty-five million, one hundred twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •