Base | Representation |
---|---|
bin | 11000100010000100101100… |
… | …010100000000000000000001 |
3 | 112011000121212100202220220001 |
4 | 120202010230110000000001 |
5 | 103120221133410230301 |
6 | 1021250034104520001 |
7 | 31504062121352101 |
oct | 3042045424000001 |
9 | 464017770686801 |
10 | 107894616883201 |
11 | 31418939472a55 |
12 | 10126848a80001 |
13 | 4828559bbc055 |
14 | 1c901ad521201 |
15 | c718beb17c01 |
hex | 62212c500001 |
107894616883201 has 16 divisors (see below), whose sum is σ = 111393977131008. Its totient is φ = 104425986974400.
The previous prime is 107894616883199. The next prime is 107894616883211. The reversal of 107894616883201 is 102388616498701.
It is a cyclic number.
It is not a de Polignac number, because 107894616883201 - 21 = 107894616883199 is a prime.
It is a super-3 number, since 3×1078946168832013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107894616883211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 276697296 + ... + 277086958.
It is an arithmetic number, because the mean of its divisors is an integer number (6962123570688).
Almost surely, 2107894616883201 is an apocalyptic number.
It is an amenable number.
107894616883201 is a deficient number, since it is larger than the sum of its proper divisors (3499360247807).
107894616883201 is a wasteful number, since it uses less digits than its factorization.
107894616883201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429072.
The product of its (nonzero) digits is 27869184, while the sum is 64.
The spelling of 107894616883201 in words is "one hundred seven trillion, eight hundred ninety-four billion, six hundred sixteen million, eight hundred eighty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •