Base | Representation |
---|---|
bin | 10100000000100101… |
… | …10111111111000011 |
3 | 1000201122122202000212 |
4 | 22000102313333003 |
5 | 134000021204042 |
6 | 4533542104335 |
7 | 530130414512 |
oct | 120022677703 |
9 | 30648582025 |
10 | 10742366147 |
11 | 4612870757 |
12 | 20b971b0ab |
13 | 1022741396 |
14 | 73c9a8679 |
15 | 42d14d482 |
hex | 2804b7fc3 |
10742366147 has 4 divisors (see below), whose sum is σ = 11374270056. Its totient is φ = 10110462240.
The previous prime is 10742366123. The next prime is 10742366183. The reversal of 10742366147 is 74166324701.
10742366147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10742366147 - 26 = 10742366083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10742366197) 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 3 ways as a sum of consecutive naturals, for example, 315951929 + ... + 315951962.
It is an arithmetic number, because the mean of its divisors is an integer number (2843567514).
Almost surely, 210742366147 is an apocalyptic number.
10742366147 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
10742366147 is a deficient number, since it is larger than the sum of its proper divisors (631903909).
10742366147 is an equidigital number, since it uses as much as digits as its factorization.
10742366147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631903908.
The product of its (nonzero) digits is 169344, while the sum is 41.
The spelling of 10742366147 in words is "ten billion, seven hundred forty-two million, three hundred sixty-six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •