Base | Representation |
---|---|
bin | 11110010001000100000110… |
… | …001101101101000100011101 |
3 | 122110022120120022200021220111 |
4 | 132101010012031231010131 |
5 | 114421420011032120301 |
6 | 1151035423355050021 |
7 | 40016112435116251 |
oct | 3621040615550435 |
9 | 573276508607814 |
10 | 133114025660701 |
11 | 39461383234528 |
12 | 12b1a481a40911 |
13 | 59377a2619527 |
14 | 24c2a78b8c261 |
15 | 105c904528551 |
hex | 79110636d11d |
133114025660701 has 2 divisors, whose sum is σ = 133114025660702. Its totient is φ = 133114025660700.
The previous prime is 133114025660593. The next prime is 133114025660729. The reversal of 133114025660701 is 107066520411331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112731518600100 + 20382507060601 = 10617510^2 + 4514699^2 .
It is a cyclic number.
It is not a de Polignac number, because 133114025660701 - 219 = 133114025136413 is a prime.
It is a super-2 number, since 2×1331140256607012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133114025660101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66557012830350 + 66557012830351.
It is an arithmetic number, because the mean of its divisors is an integer number (66557012830351).
Almost surely, 2133114025660701 is an apocalyptic number.
It is an amenable number.
133114025660701 is a deficient number, since it is larger than the sum of its proper divisors (1).
133114025660701 is an equidigital number, since it uses as much as digits as its factorization.
133114025660701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 40.
The spelling of 133114025660701 in words is "one hundred thirty-three trillion, one hundred fourteen billion, twenty-five million, six hundred sixty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •