Base | Representation |
---|---|
bin | 10100000001000111… |
… | …00010011011111111 |
3 | 1000201221212200001121 |
4 | 22000203202123333 |
5 | 134002130444320 |
6 | 4534215451411 |
7 | 530212506661 |
oct | 120043423377 |
9 | 30657780047 |
10 | 10746734335 |
11 | 4615284627 |
12 | 20bb086b67 |
13 | 10236106cc |
14 | 73d3c4531 |
15 | 42d7128aa |
hex | 2808e26ff |
10746734335 has 8 divisors (see below), whose sum is σ = 12896730000. Its totient is φ = 8596954944.
The previous prime is 10746734333. The next prime is 10746734351. The reversal of 10746734335 is 53343764701.
It is a happy number.
10746734335 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10746734335 - 21 = 10746734333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10746734291 and 10746734300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10746734333) 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, 90304 + ... + 172186.
It is an arithmetic number, because the mean of its divisors is an integer number (1612091250).
Almost surely, 210746734335 is an apocalyptic number.
10746734335 is a deficient number, since it is larger than the sum of its proper divisors (2149995665).
10746734335 is an equidigital number, since it uses as much as digits as its factorization.
10746734335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108137.
The product of its (nonzero) digits is 635040, while the sum is 43.
The spelling of 10746734335 in words is "ten billion, seven hundred forty-six million, seven hundred thirty-four thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •