Base | Representation |
---|---|
bin | 11101100011101111111… |
… | …011101000100000011101 |
3 | 21012012000022010211102101 |
4 | 131203233323220200131 |
5 | 231234444441410444 |
6 | 4153050543525101 |
7 | 266516160463135 |
oct | 35435773504035 |
9 | 7165008124371 |
10 | 2031249950749 |
11 | 7134a2708368 |
12 | 2898055b9791 |
13 | 11971388c7a6 |
14 | 70454d0bac5 |
15 | 37c8670c3d4 |
hex | 1d8efee881d |
2031249950749 has 2 divisors, whose sum is σ = 2031249950750. Its totient is φ = 2031249950748.
The previous prime is 2031249950713. The next prime is 2031249950767. The reversal of 2031249950749 is 9470599421302.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1997501688900 + 33748261849 = 1413330^2 + 183707^2 .
It is a cyclic number.
It is not a de Polignac number, because 2031249950749 - 29 = 2031249950237 is a prime.
It is a super-2 number, since 2×20312499507492 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2031249950749.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2031249957749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015624975374 + 1015624975375.
It is an arithmetic number, because the mean of its divisors is an integer number (1015624975375).
Almost surely, 22031249950749 is an apocalyptic number.
It is an amenable number.
2031249950749 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031249950749 is an equidigital number, since it uses as much as digits as its factorization.
2031249950749 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4898880, while the sum is 55.
The spelling of 2031249950749 in words is "two trillion, thirty-one billion, two hundred forty-nine million, nine hundred fifty thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •