Base | Representation |
---|---|
bin | 11110001111111111100011… |
… | …101000011010011010010011 |
3 | 122110001112121101100221221002 |
4 | 132033333203220122122103 |
5 | 114414213300314444241 |
6 | 1150541532534252215 |
7 | 40010565622006532 |
oct | 3617774350323223 |
9 | 573045541327832 |
10 | 133040431015571 |
11 | 39433147a51362 |
12 | 12b081631b706b |
13 | 5930874548231 |
14 | 24bd2969bc319 |
15 | 105aa4856289b |
hex | 78ffe3a1a693 |
133040431015571 has 2 divisors, whose sum is σ = 133040431015572. Its totient is φ = 133040431015570.
The previous prime is 133040431015501. The next prime is 133040431015573. The reversal of 133040431015571 is 175510134040331.
It is a strong prime.
It is an emirp because it is prime and its reverse (175510134040331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133040431015571 - 226 = 133040363906707 is a prime.
It is a super-2 number, since 2×1330404310155712 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 133040431015573, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (133040431015573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66520215507785 + 66520215507786.
It is an arithmetic number, because the mean of its divisors is an integer number (66520215507786).
Almost surely, 2133040431015571 is an apocalyptic number.
133040431015571 is a deficient number, since it is larger than the sum of its proper divisors (1).
133040431015571 is an equidigital number, since it uses as much as digits as its factorization.
133040431015571 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 75600, while the sum is 38.
The spelling of 133040431015571 in words is "one hundred thirty-three trillion, forty billion, four hundred thirty-one million, fifteen thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •