Base | Representation |
---|---|
bin | 11000111001011110101… |
… | …11100100010001110111 |
3 | 10000210011210101022222002 |
4 | 30130233113210101313 |
5 | 103004022224331332 |
6 | 1453001432125515 |
7 | 115543630132061 |
oct | 14345727442167 |
9 | 3023153338862 |
10 | 855493198967 |
11 | 2aa8a3676500 |
12 | 119972b3689b |
13 | 62898abb594 |
14 | 2d59845c731 |
15 | 173c0061562 |
hex | c72f5e4477 |
855493198967 has 24 divisors (see below), whose sum is σ = 1003489417728. Its totient is φ = 726209003520.
The previous prime is 855493198961. The next prime is 855493198991. The reversal of 855493198967 is 769891394558.
It is a de Polignac number, because none of the positive numbers 2k-855493198967 is a prime.
It is a super-2 number, since 2×8554931989672 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 855493198894 and 855493198903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (855493198961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1376138 + ... + 1898615.
It is an arithmetic number, because the mean of its divisors is an integer number (41812059072).
Almost surely, 2855493198967 is an apocalyptic number.
855493198967 is a deficient number, since it is larger than the sum of its proper divisors (147996218761).
855493198967 is a wasteful number, since it uses less digits than its factorization.
855493198967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3274919 (or 3274908 counting only the distinct ones).
The product of its digits is 587865600, while the sum is 74.
The spelling of 855493198967 in words is "eight hundred fifty-five billion, four hundred ninety-three million, one hundred ninety-eight thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •