Base | Representation |
---|---|
bin | 10100000111001111… |
… | …10010010101101010 |
3 | 1000212112200100211010 |
4 | 22003213302111222 |
5 | 134103313222230 |
6 | 4543254244350 |
7 | 531406004304 |
oct | 120347622552 |
9 | 30775610733 |
10 | 10798179690 |
11 | 4641322251 |
12 | 21143566b6 |
13 | 103118394c |
14 | 746176974 |
15 | 432ec59b0 |
hex | 2839f256a |
10798179690 has 16 divisors (see below), whose sum is σ = 25915631328. Its totient is φ = 2879514576.
The previous prime is 10798179661. The next prime is 10798179713. The reversal of 10798179690 is 9697189701.
10798179690 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×107981796902 (a number of 21 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 10798179690.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 179969632 + ... + 179969691.
It is an arithmetic number, because the mean of its divisors is an integer number (1619726958).
Almost surely, 210798179690 is an apocalyptic number.
10798179690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10798179690 is an abundant number, since it is smaller than the sum of its proper divisors (15117451638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10798179690 is a wasteful number, since it uses less digits than its factorization.
10798179690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359939333.
The product of its (nonzero) digits is 1714608, while the sum is 57.
The spelling of 10798179690 in words is "ten billion, seven hundred ninety-eight million, one hundred seventy-nine thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •