Base | Representation |
---|---|
bin | 111101111100101001… |
… | …0101000100101001001 |
3 | 110201101012002212110112 |
4 | 1323321102220211021 |
5 | 4134422021233343 |
6 | 141040325124105 |
7 | 12416433334034 |
oct | 1737122504511 |
9 | 421335085415 |
10 | 133031430473 |
11 | 51466857777 |
12 | 21947b59635 |
13 | c710c42186 |
14 | 661dd3401b |
15 | 36d9065218 |
hex | 1ef94a8949 |
133031430473 has 2 divisors, whose sum is σ = 133031430474. Its totient is φ = 133031430472.
The previous prime is 133031430431. The next prime is 133031430491. The reversal of 133031430473 is 374034130331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105451521289 + 27579909184 = 324733^2 + 166072^2 .
It is an emirp because it is prime and its reverse (374034130331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133031430473 - 216 = 133031364937 is a prime.
It is a super-2 number, since 2×1330314304732 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133036430473) 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, 66515715236 + 66515715237.
It is an arithmetic number, because the mean of its divisors is an integer number (66515715237).
Almost surely, 2133031430473 is an apocalyptic number.
It is an amenable number.
133031430473 is a deficient number, since it is larger than the sum of its proper divisors (1).
133031430473 is an equidigital number, since it uses as much as digits as its factorization.
133031430473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 32.
The spelling of 133031430473 in words is "one hundred thirty-three billion, thirty-one million, four hundred thirty thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •