Base | Representation |
---|---|
bin | 111101111110111111… |
… | …0110100001010001011 |
3 | 110201120200011202201011 |
4 | 1323331332310022023 |
5 | 4140102142333344 |
6 | 141052215504351 |
7 | 12421410234544 |
oct | 1737576641213 |
9 | 421520152634 |
10 | 133110121099 |
11 | 514a721414a |
12 | 2196a3880b7 |
13 | c724334587 |
14 | 662a5794cb |
15 | 36e0e0ad34 |
hex | 1efdfb428b |
133110121099 has 2 divisors, whose sum is σ = 133110121100. Its totient is φ = 133110121098.
The previous prime is 133110121069. The next prime is 133110121103. The reversal of 133110121099 is 990121011331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133110121099 - 213 = 133110112907 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133110121099.
It is not a weakly prime, because it can be changed into another prime (133110121069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66555060549 + 66555060550.
It is an arithmetic number, because the mean of its divisors is an integer number (66555060550).
Almost surely, 2133110121099 is an apocalyptic number.
133110121099 is a deficient number, since it is larger than the sum of its proper divisors (1).
133110121099 is an equidigital number, since it uses as much as digits as its factorization.
133110121099 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 133110121099 in words is "one hundred thirty-three billion, one hundred ten million, one hundred twenty-one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.893 sec. • engine limits •