Base | Representation |
---|---|
bin | 10101100100010010110110… |
… | …000111000000001110100101 |
3 | 110102211212110112111102102121 |
4 | 111210102312013000032211 |
5 | 44413033133420212432 |
6 | 533422530225105541 |
7 | 25656624365013265 |
oct | 2544226607001645 |
9 | 412755415442377 |
10 | 94853113054117 |
11 | 2824aa8555a170 |
12 | a77b2037882b1 |
13 | 40c07c174b2b2 |
14 | 195ccb530d7a5 |
15 | ae7531945197 |
hex | 5644b61c03a5 |
94853113054117 has 8 divisors (see below), whose sum is σ = 103476567987072. Its totient is φ = 86229732230400.
The previous prime is 94853113054103. The next prime is 94853113054123. The reversal of 94853113054117 is 71145031135849.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 94853113054117 - 211 = 94853113052069 is a prime.
It is a super-3 number, since 3×948531130541173 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (94853113057117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15834108 + ... + 20986309.
It is an arithmetic number, because the mean of its divisors is an integer number (12934570998384).
Almost surely, 294853113054117 is an apocalyptic number.
It is an amenable number.
94853113054117 is a deficient number, since it is larger than the sum of its proper divisors (8623454932955).
94853113054117 is a wasteful number, since it uses less digits than its factorization.
94853113054117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37054619.
The product of its (nonzero) digits is 1814400, while the sum is 52.
The spelling of 94853113054117 in words is "ninety-four trillion, eight hundred fifty-three billion, one hundred thirteen million, fifty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •