Base | Representation |
---|---|
bin | 10010101110100010… |
… | …11100011010001101 |
3 | 221221200121110221022 |
4 | 21113101130122031 |
5 | 131042324001242 |
6 | 4341354443525 |
7 | 504102440234 |
oct | 112721343215 |
9 | 27850543838 |
10 | 10054125197 |
11 | 429a323086 |
12 | 1b471335a5 |
13 | c42c8b40c |
14 | 6b5411b1b |
15 | 3dca000d2 |
hex | 25745c68d |
10054125197 has 2 divisors, whose sum is σ = 10054125198. Its totient is φ = 10054125196.
The previous prime is 10054125161. The next prime is 10054125269. The reversal of 10054125197 is 79152145001.
It is a happy number.
10054125197 is digitally balanced in base 2, because in such base 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., 10003800361 + 50324836 = 100019^2 + 7094^2 .
It is an emirp because it is prime and its reverse (79152145001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10054125197 - 222 = 10049930893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10054125097) 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, 5027062598 + 5027062599.
It is an arithmetic number, because the mean of its divisors is an integer number (5027062599).
Almost surely, 210054125197 is an apocalyptic number.
It is an amenable number.
10054125197 is a deficient number, since it is larger than the sum of its proper divisors (1).
10054125197 is an equidigital number, since it uses as much as digits as its factorization.
10054125197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 35.
The spelling of 10054125197 in words is "ten billion, fifty-four million, one hundred twenty-five thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •