Base | Representation |
---|---|
bin | 11110010001000000011101… |
… | …000000111001101101010101 |
3 | 122110022012110122201101000001 |
4 | 132101000131000321231111 |
5 | 114421334002440311034 |
6 | 1151033535233451301 |
7 | 40015613456633053 |
oct | 3621003500715525 |
9 | 573265418641001 |
10 | 133110113213269 |
11 | 3945a75580a8a5 |
12 | 12b1976b710b31 |
13 | 59372caba0a8a |
14 | 24c27c73091d3 |
15 | 105c775ce9a14 |
hex | 79101d039b55 |
133110113213269 has 2 divisors, whose sum is σ = 133110113213270. Its totient is φ = 133110113213268.
The previous prime is 133110113213131. The next prime is 133110113213321. The reversal of 133110113213269 is 962312311011331.
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., 122282393910769 + 10827719302500 = 11058137^2 + 3290550^2 .
It is a cyclic number.
It is not a de Polignac number, because 133110113213269 - 233 = 133101523278677 is a prime.
It is a super-2 number, since 2×1331101132132692 (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 (133110113211269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66555056606634 + 66555056606635.
It is an arithmetic number, because the mean of its divisors is an integer number (66555056606635).
Almost surely, 2133110113213269 is an apocalyptic number.
It is an amenable number.
133110113213269 is a deficient number, since it is larger than the sum of its proper divisors (1).
133110113213269 is an equidigital number, since it uses as much as digits as its factorization.
133110113213269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 37.
The spelling of 133110113213269 in words is "one hundred thirty-three trillion, one hundred ten billion, one hundred thirteen million, two hundred thirteen thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •