Base | Representation |
---|---|
bin | 11110001111100011101100… |
… | …001101111111001101000111 |
3 | 122102221200101011021202011111 |
4 | 132033203230031333031013 |
5 | 114413221011114443023 |
6 | 1150520103533545451 |
7 | 40005456304144423 |
oct | 3617435415771507 |
9 | 572850334252144 |
10 | 133010510312263 |
11 | 39421493549091 |
12 | 12b023b2945287 |
13 | 592aab672836c |
14 | 24bba58cd5b83 |
15 | 1059d9689e00d |
hex | 78f8ec37f347 |
133010510312263 has 2 divisors, whose sum is σ = 133010510312264. Its totient is φ = 133010510312262.
The previous prime is 133010510312243. The next prime is 133010510312347. The reversal of 133010510312263 is 362213015010331.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (362213015010331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133010510312263 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133010510312243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66505255156131 + 66505255156132.
It is an arithmetic number, because the mean of its divisors is an integer number (66505255156132).
Almost surely, 2133010510312263 is an apocalyptic number.
133010510312263 is a deficient number, since it is larger than the sum of its proper divisors (1).
133010510312263 is an equidigital number, since it uses as much as digits as its factorization.
133010510312263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 133010510312263 its reverse (362213015010331), we get a palindrome (495223525322594).
The spelling of 133010510312263 in words is "one hundred thirty-three trillion, ten billion, five hundred ten million, three hundred twelve thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •