Base | Representation |
---|---|
bin | 11110111100101110111… |
… | …11010101001110011110 |
3 | 10202122211001212200010102 |
4 | 33132113133111032132 |
5 | 114410320003321014 |
6 | 2132304000141102 |
7 | 136554002032553 |
oct | 17362737251636 |
9 | 3678731780112 |
10 | 1063398495134 |
11 | 37aa91800718 |
12 | 152116007792 |
13 | 7937cb428a1 |
14 | 3967c3d4a2a |
15 | 1c9dc5258de |
hex | f7977d539e |
1063398495134 has 4 divisors (see below), whose sum is σ = 1595097742704. Its totient is φ = 531699247566.
The previous prime is 1063398495121. The next prime is 1063398495143. The reversal of 1063398495134 is 4315948933601.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×10633984951342 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1063398495134.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265849623782 + ... + 265849623785.
It is an arithmetic number, because the mean of its divisors is an integer number (398774435676).
Almost surely, 21063398495134 is an apocalyptic number.
1063398495134 is a deficient number, since it is larger than the sum of its proper divisors (531699247570).
1063398495134 is an equidigital number, since it uses as much as digits as its factorization.
1063398495134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531699247569.
The product of its (nonzero) digits is 8398080, while the sum is 56.
The spelling of 1063398495134 in words is "one trillion, sixty-three billion, three hundred ninety-eight million, four hundred ninety-five thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •