Base | Representation |
---|---|
bin | 11101000111010101010… |
… | …10110001010001000101 |
3 | 10112122010110200121200020 |
4 | 32203222222301101011 |
5 | 112342224042234221 |
6 | 2043321410005353 |
7 | 132163042251201 |
oct | 16435252612105 |
9 | 3478113617606 |
10 | 1000369493061 |
11 | 356288554564 |
12 | 141a65876859 |
13 | 734469b84a3 |
14 | 365bd549b01 |
15 | 1b04de00ac6 |
hex | e8eaab1445 |
1000369493061 has 16 divisors (see below), whose sum is σ = 1336671633408. Its totient is φ = 665490394800.
The previous prime is 1000369493059. The next prime is 1000369493153. The reversal of 1000369493061 is 1603949630001.
It is not a de Polignac number, because 1000369493061 - 21 = 1000369493059 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000369493021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28312596 + ... + 28347906.
It is an arithmetic number, because the mean of its divisors is an integer number (83541977088).
Almost surely, 21000369493061 is an apocalyptic number.
It is an amenable number.
1000369493061 is a deficient number, since it is larger than the sum of its proper divisors (336302140347).
1000369493061 is a wasteful number, since it uses less digits than its factorization.
1000369493061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55192.
The product of its (nonzero) digits is 104976, while the sum is 42.
The spelling of 1000369493061 in words is "one trillion, three hundred sixty-nine million, four hundred ninety-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •