Base | Representation |
---|---|
bin | 11110010111001000101000… |
… | …100101010011111000011111 |
3 | 122111210110101220022221202001 |
4 | 132113020220211103320133 |
5 | 120000233411302231142 |
6 | 1151555220511143131 |
7 | 40061211652265206 |
oct | 3627105045237037 |
9 | 574713356287661 |
10 | 133531214102047 |
11 | 396022a7233253 |
12 | 12b872b1514aa7 |
13 | 5967c29cb9108 |
14 | 24d8d33a8423d |
15 | 10686bee1d5b7 |
hex | 797228953e1f |
133531214102047 has 2 divisors, whose sum is σ = 133531214102048. Its totient is φ = 133531214102046.
The previous prime is 133531214102029. The next prime is 133531214102129. The reversal of 133531214102047 is 740201412135331.
It is a weak prime.
It is an emirp because it is prime and its reverse (740201412135331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133531214102047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133531214101997 and 133531214102015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133531214102647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66765607051023 + 66765607051024.
It is an arithmetic number, because the mean of its divisors is an integer number (66765607051024).
Almost surely, 2133531214102047 is an apocalyptic number.
133531214102047 is a deficient number, since it is larger than the sum of its proper divisors (1).
133531214102047 is an equidigital number, since it uses as much as digits as its factorization.
133531214102047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 37.
Adding to 133531214102047 its reverse (740201412135331), we get a palindrome (873732626237378).
The spelling of 133531214102047 in words is "one hundred thirty-three trillion, five hundred thirty-one billion, two hundred fourteen million, one hundred two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •