Base | Representation |
---|---|
bin | 10111101011011100110111… |
… | …011001011001111111001001 |
3 | 111122201210010110002011211101 |
4 | 113223130313121121333021 |
5 | 102122221232331324113 |
6 | 1005253414322501401 |
7 | 30635640045434455 |
oct | 2753346731317711 |
9 | 448653113064741 |
10 | 104141001433033 |
11 | 30200a503a4394 |
12 | b81b282804861 |
13 | 46155ba122b96 |
14 | 1ba0646781665 |
15 | c08e2e3622dd |
hex | 5eb737659fc9 |
104141001433033 has 2 divisors, whose sum is σ = 104141001433034. Its totient is φ = 104141001433032.
The previous prime is 104141001433003. The next prime is 104141001433043. The reversal of 104141001433033 is 330334100141401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65074601335689 + 39066400097344 = 8066883^2 + 6250312^2 .
It is a cyclic number.
It is not a de Polignac number, because 104141001433033 - 233 = 104132411498441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104141001432992 and 104141001433010.
It is not a weakly prime, because it can be changed into another prime (104141001433003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52070500716516 + 52070500716517.
It is an arithmetic number, because the mean of its divisors is an integer number (52070500716517).
Almost surely, 2104141001433033 is an apocalyptic number.
It is an amenable number.
104141001433033 is a deficient number, since it is larger than the sum of its proper divisors (1).
104141001433033 is an equidigital number, since it uses as much as digits as its factorization.
104141001433033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 104141001433033 its reverse (330334100141401), we get a palindrome (434475101574434).
The spelling of 104141001433033 in words is "one hundred four trillion, one hundred forty-one billion, one million, four hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •