Base | Representation |
---|---|
bin | 10010111001000110… |
… | …00000001000101101 |
3 | 222011212010011211122 |
4 | 21130203000020231 |
5 | 131233002122221 |
6 | 4354235230325 |
7 | 506225540246 |
oct | 113443001055 |
9 | 28155104748 |
10 | 10142614061 |
11 | 4335272078 |
12 | 1b708a83a5 |
13 | c584015a8 |
14 | 6c3087ccd |
15 | 3e567deab |
hex | 25c8c022d |
10142614061 has 6 divisors (see below), whose sum is σ = 10151574030. Its totient is φ = 10133660696.
The previous prime is 10142614051. The next prime is 10142614073. The reversal of 10142614061 is 16041624101.
It can be written as a sum of positive squares in only one way, i.e., 9091622500 + 1050991561 = 95350^2 + 32419^2 .
It is not a de Polignac number, because 10142614061 - 214 = 10142597677 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 10142614061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10142614051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3635255 + ... + 3638043.
It is an arithmetic number, because the mean of its divisors is an integer number (1691929005).
Almost surely, 210142614061 is an apocalyptic number.
It is an amenable number.
10142614061 is a deficient number, since it is larger than the sum of its proper divisors (8959969).
10142614061 is an frugal number, since it uses more digits than its factorization.
10142614061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6603 (or 4696 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 10142614061 in words is "ten billion, one hundred forty-two million, six hundred fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •