Base | Representation |
---|---|
bin | 10011000111111000… |
… | …00101111110000001 |
3 | 222111111110221120001 |
4 | 21203330011332001 |
5 | 132011224211230 |
6 | 4414425320001 |
7 | 512262634624 |
oct | 114374057601 |
9 | 28444427501 |
10 | 10266632065 |
11 | 4399278698 |
12 | 1ba6336001 |
13 | c78004321 |
14 | 6d572bdbb |
15 | 4014ca0ca |
hex | 263f05f81 |
10266632065 has 8 divisors (see below), whose sum is σ = 12432986280. Its totient is φ = 8137953792.
The previous prime is 10266632041. The next prime is 10266632069. The reversal of 10266632065 is 56023666201.
10266632065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2938073616 + 7328558449 = 54204^2 + 85607^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10266632065 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10266632069) by changing a digit.
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, 9418384 + ... + 9419473.
It is an arithmetic number, because the mean of its divisors is an integer number (1554123285).
Almost surely, 210266632065 is an apocalyptic number.
It is an amenable number.
10266632065 is a deficient number, since it is larger than the sum of its proper divisors (2166354215).
10266632065 is a wasteful number, since it uses less digits than its factorization.
10266632065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18837971.
The product of its (nonzero) digits is 77760, while the sum is 37.
The spelling of 10266632065 in words is "ten billion, two hundred sixty-six million, six hundred thirty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.681 sec. • engine limits •