Base | Representation |
---|---|
bin | 10010111011101011… |
… | …10010000000011101 |
3 | 222020100221122202022 |
4 | 21131311302000131 |
5 | 131304031023031 |
6 | 4400332305525 |
7 | 506611146632 |
oct | 113565620035 |
9 | 28210848668 |
10 | 10164314141 |
11 | 4346543723 |
12 | 1b780122a5 |
13 | c5ca5b787 |
14 | 6c5cd6189 |
15 | 3e751897b |
hex | 25dd7201d |
10164314141 has 16 divisors (see below), whose sum is σ = 10921236480. Its totient is φ = 9443041920.
The previous prime is 10164314137. The next prime is 10164314143. The reversal of 10164314141 is 14141346101.
10164314141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10164314141 - 22 = 10164314137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10164314141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10164314143) 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 15 ways as a sum of consecutive naturals, for example, 20 + ... + 142578.
It is an arithmetic number, because the mean of its divisors is an integer number (682577280).
Almost surely, 210164314141 is an apocalyptic number.
It is an amenable number.
10164314141 is a deficient number, since it is larger than the sum of its proper divisors (756922339).
10164314141 is a wasteful number, since it uses less digits than its factorization.
10164314141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142684.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 10164314141 in words is "ten billion, one hundred sixty-four million, three hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •