Base | Representation |
---|---|
bin | 111101111111000001… |
… | …0100011011001100101 |
3 | 110201120202000112220212 |
4 | 1323332002203121211 |
5 | 4140102420213104 |
6 | 141052252505205 |
7 | 12421421455514 |
oct | 1737602433145 |
9 | 421522015825 |
10 | 133111101029 |
11 | 514a7823405 |
12 | 2196a77b205 |
13 | c7245b860a |
14 | 662a75267b |
15 | 36e105136e |
hex | 1efe0a3665 |
133111101029 has 2 divisors, whose sum is σ = 133111101030. Its totient is φ = 133111101028.
The previous prime is 133111101023. The next prime is 133111101091. The reversal of 133111101029 is 920101111331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79198904929 + 53912196100 = 281423^2 + 232190^2 .
It is a cyclic number.
It is not a de Polignac number, because 133111101029 - 216 = 133111035493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133111100995 and 133111101013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133111101023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66555550514 + 66555550515.
It is an arithmetic number, because the mean of its divisors is an integer number (66555550515).
Almost surely, 2133111101029 is an apocalyptic number.
It is an amenable number.
133111101029 is a deficient number, since it is larger than the sum of its proper divisors (1).
133111101029 is an equidigital number, since it uses as much as digits as its factorization.
133111101029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 133111101029 in words is "one hundred thirty-three billion, one hundred eleven million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •