Base | Representation |
---|---|
bin | 11000010010101000… |
… | …01110111111100111 |
3 | 1020122212022122210011 |
4 | 30021110032333213 |
5 | 203202021414002 |
6 | 5554022111051 |
7 | 641113244353 |
oct | 141124167747 |
9 | 36585278704 |
10 | 13041201127 |
11 | 5592466479 |
12 | 263b57b487 |
13 | 12caa99176 |
14 | 8ba012463 |
15 | 514d8e8d7 |
hex | 30950efe7 |
13041201127 has 2 divisors, whose sum is σ = 13041201128. Its totient is φ = 13041201126.
The previous prime is 13041201097. The next prime is 13041201137. The reversal of 13041201127 is 72110214031.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13041201127 - 215 = 13041168359 is a prime.
It is a super-3 number, since 3×130412011273 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13041201098 and 13041201107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13041201137) 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, 6520600563 + 6520600564.
It is an arithmetic number, because the mean of its divisors is an integer number (6520600564).
Almost surely, 213041201127 is an apocalyptic number.
13041201127 is a deficient number, since it is larger than the sum of its proper divisors (1).
13041201127 is an equidigital number, since it uses as much as digits as its factorization.
13041201127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 13041201127 its reverse (72110214031), we get a palindrome (85151415158).
The spelling of 13041201127 in words is "thirteen billion, forty-one million, two hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •