Base | Representation |
---|---|
bin | 10010111100100000… |
… | …10100111111000110 |
3 | 222020212001012201200 |
4 | 21132100110333012 |
5 | 131312321220113 |
6 | 4401141403330 |
7 | 510024252414 |
oct | 113620247706 |
9 | 28225035650 |
10 | 10171273158 |
11 | 434a467082 |
12 | 1b7a409546 |
13 | c61327137 |
14 | 6c6bc82b4 |
15 | 3e7e40873 |
hex | 25e414fc6 |
10171273158 has 12 divisors (see below), whose sum is σ = 22037758548. Its totient is φ = 3390424380.
The previous prime is 10171273129. The next prime is 10171273159. The reversal of 10171273158 is 85137217101.
10171273158 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10171273159) 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 5 ways as a sum of consecutive naturals, for example, 282535348 + ... + 282535383.
It is an arithmetic number, because the mean of its divisors is an integer number (1836479879).
Almost surely, 210171273158 is an apocalyptic number.
10171273158 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
10171273158 is an abundant number, since it is smaller than the sum of its proper divisors (11866485390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10171273158 is a wasteful number, since it uses less digits than its factorization.
10171273158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565070739 (or 565070736 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 36.
The spelling of 10171273158 in words is "ten billion, one hundred seventy-one million, two hundred seventy-three thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •