Base | Representation |
---|---|
bin | 10011111000110001… |
… | …01010000010110001 |
3 | 1000120002020021012120 |
4 | 21330120222002301 |
5 | 133331223214131 |
6 | 4523240144453 |
7 | 525403034124 |
oct | 117430520261 |
9 | 30502207176 |
10 | 10676773041 |
11 | 458983a680 |
12 | 209b768129 |
13 | 1011c866ac |
14 | 733db23bb |
15 | 4274e3496 |
hex | 27c62a0b1 |
10676773041 has 16 divisors (see below), whose sum is σ = 16443373248. Its totient is φ = 6090137600.
The previous prime is 10676772989. The next prime is 10676773061. The reversal of 10676773041 is 14037767601.
It is a cyclic number.
It is not a de Polignac number, because 10676773041 - 29 = 10676772529 is a prime.
It is a super-2 number, since 2×106767730412 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 10676772984 and 10676773002.
It is not an unprimeable number, because it can be changed into a prime (10676773061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9515280 + ... + 9516401.
It is an arithmetic number, because the mean of its divisors is an integer number (1027710828).
Almost surely, 210676773041 is an apocalyptic number.
10676773041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10676773041 is a deficient number, since it is larger than the sum of its proper divisors (5766600207).
10676773041 is a wasteful number, since it uses less digits than its factorization.
10676773041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19031712.
The product of its (nonzero) digits is 148176, while the sum is 42.
The spelling of 10676773041 in words is "ten billion, six hundred seventy-six million, seven hundred seventy-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •