Base | Representation |
---|---|
bin | 11000011011010011000001… |
… | …000101011111011111001101 |
3 | 112002101002221000220222011121 |
4 | 120123103001011133133031 |
5 | 103040104003112344213 |
6 | 1020252103352520541 |
7 | 31425325545442534 |
oct | 3033230105373715 |
9 | 462332830828147 |
10 | 107428961449933 |
11 | 31259404086902 |
12 | 100705519b0151 |
13 | 47c367a25ac16 |
14 | 1c7583775131b |
15 | c6471924788d |
hex | 61b4c115f7cd |
107428961449933 has 2 divisors, whose sum is σ = 107428961449934. Its totient is φ = 107428961449932.
The previous prime is 107428961449853. The next prime is 107428961449939. The reversal of 107428961449933 is 339944169824701.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88978130883684 + 18450830566249 = 9432822^2 + 4295443^2 .
It is a cyclic number.
It is not a de Polignac number, because 107428961449933 - 225 = 107428927895501 is a prime.
It is a super-2 number, since 2×1074289614499332 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107428961449939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53714480724966 + 53714480724967.
It is an arithmetic number, because the mean of its divisors is an integer number (53714480724967).
Almost surely, 2107428961449933 is an apocalyptic number.
It is an amenable number.
107428961449933 is a deficient number, since it is larger than the sum of its proper divisors (1).
107428961449933 is an equidigital number, since it uses as much as digits as its factorization.
107428961449933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 282175488, while the sum is 70.
The spelling of 107428961449933 in words is "one hundred seven trillion, four hundred twenty-eight billion, nine hundred sixty-one million, four hundred forty-nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •