Base | Representation |
---|---|
bin | 10100000100100100… |
… | …11100000000011010 |
3 | 1000210222120122212010 |
4 | 22002102130000122 |
5 | 134032101242403 |
6 | 4541134530350 |
7 | 531014560650 |
oct | 120222340032 |
9 | 30728518763 |
10 | 10775805978 |
11 | 462a730583 |
12 | 21089669b6 |
13 | 102964bc72 |
14 | 7431d0dd0 |
15 | 431056603 |
hex | 28249c01a |
10775805978 has 16 divisors (see below), whose sum is σ = 24630413760. Its totient is φ = 3078801696.
The previous prime is 10775805973. The next prime is 10775805983. The reversal of 10775805978 is 87950857701.
10775805978 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10775805973) and next prime (10775805983).
It is a super-2 number, since 2×107758059782 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10775805973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128283363 + ... + 128283446.
It is an arithmetic number, because the mean of its divisors is an integer number (1539400860).
Almost surely, 210775805978 is an apocalyptic number.
10775805978 is an abundant number, since it is smaller than the sum of its proper divisors (13854607782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10775805978 is a wasteful number, since it uses less digits than its factorization.
10775805978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256566821.
The product of its (nonzero) digits is 4939200, while the sum is 57.
The spelling of 10775805978 in words is "ten billion, seven hundred seventy-five million, eight hundred five thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •