Base | Representation |
---|---|
bin | 10011110011101100… |
… | …00010101100010011 |
3 | 1000110010000111212212 |
4 | 21321312002230103 |
5 | 133234320111111 |
6 | 4515114342335 |
7 | 524344510553 |
oct | 117166025423 |
9 | 30403014785 |
10 | 10634144531 |
11 | 45677741aa |
12 | 208942a9ab |
13 | 10061ac61a |
14 | 72c477163 |
15 | 4238c298b |
hex | 279d82b13 |
10634144531 has 8 divisors (see below), whose sum is σ = 11101767600. Its totient is φ = 10173250080.
The previous prime is 10634144527. The next prime is 10634144557. The reversal of 10634144531 is 13544143601.
It is a happy number.
10634144531 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 10634144531 - 22 = 10634144527 is a prime.
It is a super-2 number, since 2×106341445312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10634149531) 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, 1678925 + ... + 1685246.
It is an arithmetic number, because the mean of its divisors is an integer number (1387720950).
Almost surely, 210634144531 is an apocalyptic number.
10634144531 is a deficient number, since it is larger than the sum of its proper divisors (467623069).
10634144531 is a wasteful number, since it uses less digits than its factorization.
10634144531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3364309.
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 10634144531 in words is "ten billion, six hundred thirty-four million, one hundred forty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •