Base | Representation |
---|---|
bin | 10011111010011001… |
… | …10010111001000000 |
3 | 1000121000221122210200 |
4 | 21331030302321000 |
5 | 133343223101033 |
6 | 4524445125200 |
7 | 525630150540 |
oct | 117514627100 |
9 | 30530848720 |
10 | 10690440768 |
11 | 4596525417 |
12 | 20a4259800 |
13 | 1014a607c7 |
14 | 735b2d320 |
15 | 4287e3013 |
hex | 27d332e40 |
10690440768 has 336 divisors, whose sum is σ = 36593556480. Its totient is φ = 2922670080.
The previous prime is 10690440767. The next prime is 10690440793. The reversal of 10690440768 is 86704409601.
It is a tau number, because it is divible by the number of its divisors (336).
It is a super-2 number, since 2×106904407682 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10690440767) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 120117268 + ... + 120117356.
Almost surely, 210690440768 is an apocalyptic number.
10690440768 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10690440768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18296778240).
10690440768 is an abundant number, since it is smaller than the sum of its proper divisors (25903115712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10690440768 is an frugal number, since it uses more digits than its factorization.
10690440768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207 (or 132 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 45.
The spelling of 10690440768 in words is "ten billion, six hundred ninety million, four hundred forty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •