Base | Representation |
---|---|
bin | 111010011010110100… |
… | …1000010000011101001 |
3 | 102222211002211112110211 |
4 | 1310311221002003221 |
5 | 4023412211002421 |
6 | 133344402341121 |
7 | 12030603260044 |
oct | 1646551020351 |
9 | 388732745424 |
10 | 125454000361 |
11 | 49228570338 |
12 | 2039235a7a1 |
13 | baa4113711 |
14 | 6101827c5b |
15 | 33e3bda9e1 |
hex | 1d35a420e9 |
125454000361 has 2 divisors, whose sum is σ = 125454000362. Its totient is φ = 125454000360.
The previous prime is 125454000341. The next prime is 125454000407. The reversal of 125454000361 is 163000454521.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112785147225 + 12668853136 = 335835^2 + 112556^2 .
It is an emirp because it is prime and its reverse (163000454521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 125454000361 - 215 = 125453967593 is a prime.
It is not a weakly prime, because it can be changed into another prime (125454000341) 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, 62727000180 + 62727000181.
It is an arithmetic number, because the mean of its divisors is an integer number (62727000181).
Almost surely, 2125454000361 is an apocalyptic number.
It is an amenable number.
125454000361 is a deficient number, since it is larger than the sum of its proper divisors (1).
125454000361 is an equidigital number, since it uses as much as digits as its factorization.
125454000361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 125454000361 its reverse (163000454521), we get a palindrome (288454454882).
The spelling of 125454000361 in words is "one hundred twenty-five billion, four hundred fifty-four million, three hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •