Base | Representation |
---|---|
bin | 10010111000000110… |
… | …00000111111100111 |
3 | 222011021100011122121 |
4 | 21130003000333213 |
5 | 131223330311332 |
6 | 4353335410411 |
7 | 506064345022 |
oct | 113403007747 |
9 | 28137304577 |
10 | 10134228967 |
11 | 4330565245 |
12 | 1b69b23a07 |
13 | c56756ab5 |
14 | 6c1d041b9 |
15 | 3e4a74797 |
hex | 25c0c0fe7 |
10134228967 has 4 divisors (see below), whose sum is σ = 10136856240. Its totient is φ = 10131601696.
The previous prime is 10134228947. The next prime is 10134228977. The reversal of 10134228967 is 76982243101.
10134228967 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, and also an emirpimes, since its reverse is a distinct semiprime: 76982243101 = 67 ⋅1148988703.
It is a cyclic number.
It is not a de Polignac number, because 10134228967 - 215 = 10134196199 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10134228917) 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, 1307842 + ... + 1315567.
It is an arithmetic number, because the mean of its divisors is an integer number (2534214060).
Almost surely, 210134228967 is an apocalyptic number.
10134228967 is a deficient number, since it is larger than the sum of its proper divisors (2627273).
10134228967 is an equidigital number, since it uses as much as digits as its factorization.
10134228967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2627272.
The product of its (nonzero) digits is 145152, while the sum is 43.
The spelling of 10134228967 in words is "ten billion, one hundred thirty-four million, two hundred twenty-eight thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •