Base | Representation |
---|---|
bin | 10111101110001111111111… |
… | …001001100111110001111101 |
3 | 111200102011120020122201002022 |
4 | 113232033333021213301331 |
5 | 102133344130303040303 |
6 | 1005522023135205525 |
7 | 30655556132352134 |
oct | 2756177711476175 |
9 | 450364506581068 |
10 | 104333331299453 |
11 | 30275576610713 |
12 | b8505b96768a5 |
13 | 462a78b355c79 |
14 | 1ba9a8dd0491b |
15 | c0de39249438 |
hex | 5ee3ff267c7d |
104333331299453 has 2 divisors, whose sum is σ = 104333331299454. Its totient is φ = 104333331299452.
The previous prime is 104333331299437. The next prime is 104333331299479. The reversal of 104333331299453 is 354992133333401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96769362728164 + 7563968571289 = 9837142^2 + 2750267^2 .
It is a cyclic number.
It is not a de Polignac number, because 104333331299453 - 24 = 104333331299437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104333331299395 and 104333331299404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104333331293453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52166665649726 + 52166665649727.
It is an arithmetic number, because the mean of its divisors is an integer number (52166665649727).
Almost surely, 2104333331299453 is an apocalyptic number.
It is an amenable number.
104333331299453 is a deficient number, since it is larger than the sum of its proper divisors (1).
104333331299453 is an equidigital number, since it uses as much as digits as its factorization.
104333331299453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9447840, while the sum is 53.
The spelling of 104333331299453 in words is "one hundred four trillion, three hundred thirty-three billion, three hundred thirty-one million, two hundred ninety-nine thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •