Base | Representation |
---|---|
bin | 10011111000110001… |
… | …00010000011110010 |
3 | 1000120002011121100100 |
4 | 21330120202003302 |
5 | 133331221142323 |
6 | 4523235333230 |
7 | 525402536565 |
oct | 117430420362 |
9 | 30502147310 |
10 | 10676740338 |
11 | 4589818050 |
12 | 209b751216 |
13 | 1011c74844 |
14 | 733da44dc |
15 | 4274d8943 |
hex | 27c6220f2 |
10676740338 has 72 divisors (see below), whose sum is σ = 26634222576. Its totient is φ = 3065072400.
The previous prime is 10676740309. The next prime is 10676740379. The reversal of 10676740338 is 83304767601.
It is a super-2 number, since 2×106767403382 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10676740293 and 10676740302.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3208 + ... + 146163.
It is an arithmetic number, because the mean of its divisors is an integer number (369919758).
Almost surely, 210676740338 is an apocalyptic number.
10676740338 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10676740338, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13317111288).
10676740338 is an abundant number, since it is smaller than the sum of its proper divisors (15957482238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10676740338 is a wasteful number, since it uses less digits than its factorization.
10676740338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149428 (or 149406 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 45.
The spelling of 10676740338 in words is "ten billion, six hundred seventy-six million, seven hundred forty thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •