Base | Representation |
---|---|
bin | 111101111110111111… |
… | …1100100111111001101 |
3 | 110201120200112221001122 |
4 | 1323331333210333031 |
5 | 4140102220233401 |
6 | 141052224050325 |
7 | 12421412026622 |
oct | 1737577447715 |
9 | 421520487048 |
10 | 133110321101 |
11 | 514a734043a |
12 | 2196a4639a5 |
13 | c7243a4614 |
14 | 662a5cc349 |
15 | 36e0e4a21b |
hex | 1efdfe4fcd |
133110321101 has 2 divisors, whose sum is σ = 133110321102. Its totient is φ = 133110321100.
The previous prime is 133110321053. The next prime is 133110321143. The reversal of 133110321101 is 101123011331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131570151076 + 1540170025 = 362726^2 + 39245^2 .
It is a cyclic number.
It is not a de Polignac number, because 133110321101 - 230 = 132036579277 is a prime.
It is a super-2 number, since 2×1331103211012 (a number of 23 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 133110321101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133110321191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66555160550 + 66555160551.
It is an arithmetic number, because the mean of its divisors is an integer number (66555160551).
Almost surely, 2133110321101 is an apocalyptic number.
It is an amenable number.
133110321101 is a deficient number, since it is larger than the sum of its proper divisors (1).
133110321101 is an equidigital number, since it uses as much as digits as its factorization.
133110321101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 133110321101 its reverse (101123011331), we get a palindrome (234233332432).
The spelling of 133110321101 in words is "one hundred thirty-three billion, one hundred ten million, three hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •