Base | Representation |
---|---|
bin | 10011001111111110… |
… | …11001111010101011 |
3 | 222200020101112110210 |
4 | 21213333121322223 |
5 | 132131124442232 |
6 | 4425254312203 |
7 | 514046504406 |
oct | 114777317253 |
9 | 28606345423 |
10 | 10334609067 |
11 | 4423687832 |
12 | 2005058663 |
13 | c891150c3 |
14 | 700784d3d |
15 | 4074565cc |
hex | 267fd9eab |
10334609067 has 48 divisors (see below), whose sum is σ = 15337123200. Its totient is φ = 6171580800.
The previous prime is 10334609063. The next prime is 10334609071. The reversal of 10334609067 is 76090643301.
10334609067 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10334609063) and next prime (10334609071).
It is not a de Polignac number, because 10334609067 - 22 = 10334609063 is a prime.
It is a super-2 number, since 2×103346090672 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10334609063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2681692 + ... + 2685542.
It is an arithmetic number, because the mean of its divisors is an integer number (319523400).
Almost surely, 210334609067 is an apocalyptic number.
10334609067 is a deficient number, since it is larger than the sum of its proper divisors (5002514133).
10334609067 is a wasteful number, since it uses less digits than its factorization.
10334609067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4008 (or 3985 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 39.
The spelling of 10334609067 in words is "ten billion, three hundred thirty-four million, six hundred nine thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •