Base | Representation |
---|---|
bin | 11110010001000100001011… |
… | …011000110000100000011111 |
3 | 122110022120210100222100211022 |
4 | 132101010023120300200133 |
5 | 114421420200241210242 |
6 | 1151035440135114355 |
7 | 40016114540555141 |
oct | 3621041330604037 |
9 | 573276710870738 |
10 | 133114112444447 |
11 | 39461418219432 |
12 | 12b1a4a6b129bb |
13 | 59377b75b3564 |
14 | 24c2a864dcc91 |
15 | 105c90be6c0d2 |
hex | 79110b63081f |
133114112444447 has 2 divisors, whose sum is σ = 133114112444448. Its totient is φ = 133114112444446.
The previous prime is 133114112444363. The next prime is 133114112444503. The reversal of 133114112444447 is 744444211411331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133114112444447 - 28 = 133114112444191 is a prime.
It is a super-2 number, since 2×1331141124444472 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133114112444398 and 133114112444407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133114112744447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66557056222223 + 66557056222224.
It is an arithmetic number, because the mean of its divisors is an integer number (66557056222224).
Almost surely, 2133114112444447 is an apocalyptic number.
133114112444447 is a deficient number, since it is larger than the sum of its proper divisors (1).
133114112444447 is an equidigital number, since it uses as much as digits as its factorization.
133114112444447 is an evil number, because the sum of its binary digits is even.
The product of its digits is 516096, while the sum is 44.
Adding to 133114112444447 its reverse (744444211411331), we get a palindrome (877558323855778).
The spelling of 133114112444447 in words is "one hundred thirty-three trillion, one hundred fourteen billion, one hundred twelve million, four hundred forty-four thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •