Base | Representation |
---|---|
bin | 10010111001100011… |
… | …01111000001010101 |
3 | 222012010101101120202 |
4 | 21130301233001111 |
5 | 131234444213432 |
6 | 4354454110245 |
7 | 506303424011 |
oct | 113461570125 |
9 | 28163341522 |
10 | 10146476117 |
11 | 433746a758 |
12 | 1b7204b385 |
13 | c5915442b |
14 | 6c37b1541 |
15 | 3e5b93462 |
hex | 25cc6f055 |
10146476117 has 2 divisors, whose sum is σ = 10146476118. Its totient is φ = 10146476116.
The previous prime is 10146476113. The next prime is 10146476147. The reversal of 10146476117 is 71167464101.
10146476117 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9300480721 + 845995396 = 96439^2 + 29086^2 .
It is an emirp because it is prime and its reverse (71167464101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10146476117 - 22 = 10146476113 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10146476113) 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 as a sum of consecutive naturals, namely, 5073238058 + 5073238059.
It is an arithmetic number, because the mean of its divisors is an integer number (5073238059).
Almost surely, 210146476117 is an apocalyptic number.
It is an amenable number.
10146476117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10146476117 is an equidigital number, since it uses as much as digits as its factorization.
10146476117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28224, while the sum is 38.
The spelling of 10146476117 in words is "ten billion, one hundred forty-six million, four hundred seventy-six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •