Base | Representation |
---|---|
bin | 10011011010101011… |
… | …11010010110100011 |
3 | 222220111100010212001 |
4 | 21231111322112203 |
5 | 132322121121141 |
6 | 4442222544431 |
7 | 516216616441 |
oct | 115525722643 |
9 | 28814303761 |
10 | 10424395171 |
11 | 446a332423 |
12 | 202b138117 |
13 | ca18c0888 |
14 | 70c677b91 |
15 | 41028ea31 |
hex | 26d57a5a3 |
10424395171 has 4 divisors (see below), whose sum is σ = 10455889144. Its totient is φ = 10392901200.
The previous prime is 10424395169. The next prime is 10424395183. The reversal of 10424395171 is 17159342401.
It is a happy number.
10424395171 is digitally balanced in base 3, 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 10424395171 - 21 = 10424395169 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10424395171.
It is not an unprimeable number, because it can be changed into a prime (10424395571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15746490 + ... + 15747151.
It is an arithmetic number, because the mean of its divisors is an integer number (2613972286).
Almost surely, 210424395171 is an apocalyptic number.
10424395171 is a deficient number, since it is larger than the sum of its proper divisors (31493973).
10424395171 is an equidigital number, since it uses as much as digits as its factorization.
10424395171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31493972.
The product of its (nonzero) digits is 30240, while the sum is 37.
The spelling of 10424395171 in words is "ten billion, four hundred twenty-four million, three hundred ninety-five thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •