Base | Representation |
---|---|
bin | 11110010001000010011101… |
… | …011011000111011000011111 |
3 | 122110022102000210111222000212 |
4 | 132101002131123013120133 |
5 | 114421402410444144141 |
6 | 1151034533113043035 |
7 | 40016021036434436 |
oct | 3621023533073037 |
9 | 573272023458025 |
10 | 133112267568671 |
11 | 394606608a3a06 |
12 | 12b1a0710b647b |
13 | 59375823105a1 |
14 | 24c294d4a411d |
15 | 105c84eeec2eb |
hex | 79109d6c761f |
133112267568671 has 2 divisors, whose sum is σ = 133112267568672. Its totient is φ = 133112267568670.
The previous prime is 133112267568641. The next prime is 133112267568677. The reversal of 133112267568671 is 176865762211331.
It is a strong prime.
It is an emirp because it is prime and its reverse (176865762211331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133112267568671 - 210 = 133112267567647 is a prime.
It is a super-2 number, since 2×1331122675686712 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133112267568671.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133112267568677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66556133784335 + 66556133784336.
It is an arithmetic number, because the mean of its divisors is an integer number (66556133784336).
Almost surely, 2133112267568671 is an apocalyptic number.
133112267568671 is a deficient number, since it is larger than the sum of its proper divisors (1).
133112267568671 is an equidigital number, since it uses as much as digits as its factorization.
133112267568671 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15240960, while the sum is 59.
The spelling of 133112267568671 in words is "one hundred thirty-three trillion, one hundred twelve billion, two hundred sixty-seven million, five hundred sixty-eight thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •