Base | Representation |
---|---|
bin | 10100011010000000… |
… | …10111100111101101 |
3 | 1001021111221002200011 |
4 | 22031000113213231 |
5 | 134414114300142 |
6 | 5011040533221 |
7 | 535330136404 |
oct | 121500274755 |
9 | 31244832604 |
10 | 10955618797 |
11 | 4712185612 |
12 | 2159021211 |
13 | 1057988896 |
14 | 75d03a63b |
15 | 441c24417 |
hex | 28d0179ed |
10955618797 has 4 divisors (see below), whose sum is σ = 10955840896. Its totient is φ = 10955396700.
The previous prime is 10955618777. The next prime is 10955618803. The reversal of 10955618797 is 79781655901.
10955618797 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10955618797 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 (10955618777) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 123 + ... + 148024.
It is an arithmetic number, because the mean of its divisors is an integer number (2738960224).
Almost surely, 210955618797 is an apocalyptic number.
It is an amenable number.
10955618797 is a deficient number, since it is larger than the sum of its proper divisors (222099).
10955618797 is an equidigital number, since it uses as much as digits as its factorization.
10955618797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222098.
The product of its (nonzero) digits is 4762800, while the sum is 58.
The spelling of 10955618797 in words is "ten billion, nine hundred fifty-five million, six hundred eighteen thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •