Base | Representation |
---|---|
bin | 10101011101011110110101… |
… | …000010000011011011001101 |
3 | 110101012010000222222010122021 |
4 | 111131132311002003123031 |
5 | 44332400331021402023 |
6 | 532423502223450141 |
7 | 25611041613565663 |
oct | 2535366502033315 |
9 | 411163028863567 |
10 | 94384943544013 |
11 | 2808a480024971 |
12 | a704526756951 |
13 | 4088600c9c635 |
14 | 19443816a6c33 |
15 | ada2804b835d |
hex | 55d7b50836cd |
94384943544013 has 4 divisors (see below), whose sum is σ = 99936999046620. Its totient is φ = 88832888041408.
The previous prime is 94384943544011. The next prime is 94384943544043. The reversal of 94384943544013 is 31044534948349.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 80282800644489 + 14102142899524 = 8960067^2 + 3755282^2 .
It is a cyclic number.
It is not a de Polignac number, because 94384943544013 - 21 = 94384943544011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (94384943544011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2776027751278 + ... + 2776027751311.
It is an arithmetic number, because the mean of its divisors is an integer number (24984249761655).
Almost surely, 294384943544013 is an apocalyptic number.
It is an amenable number.
94384943544013 is a deficient number, since it is larger than the sum of its proper divisors (5552055502607).
94384943544013 is a wasteful number, since it uses less digits than its factorization.
94384943544013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5552055502606.
The product of its (nonzero) digits is 89579520, while the sum is 61.
The spelling of 94384943544013 in words is "ninety-four trillion, three hundred eighty-four billion, nine hundred forty-three million, five hundred forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •