Base | Representation |
---|---|
bin | 1110111010100… |
… | …10111101111101 |
3 | 22201102202220012 |
4 | 13131102331331 |
5 | 224012323011 |
6 | 20225433005 |
7 | 3046335311 |
oct | 735227575 |
9 | 281382805 |
10 | 125120381 |
11 | 64699881 |
12 | 35a9b765 |
13 | 1cbca739 |
14 | 1288db41 |
15 | aeb7a8b |
hex | 7752f7d |
125120381 has 2 divisors, whose sum is σ = 125120382. Its totient is φ = 125120380.
The previous prime is 125120363. The next prime is 125120393. The reversal of 125120381 is 183021521.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62568100 + 62552281 = 7910^2 + 7909^2 .
It is a cyclic number.
It is not a de Polignac number, because 125120381 - 222 = 120926077 is a prime.
It is a super-2 number, since 2×1251203812 = 31310219483170322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125120311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62560190 + 62560191.
It is an arithmetic number, because the mean of its divisors is an integer number (62560191).
Almost surely, 2125120381 is an apocalyptic number.
125120381 is the 7910-th centered square number.
It is an amenable number.
125120381 is a deficient number, since it is larger than the sum of its proper divisors (1).
125120381 is an equidigital number, since it uses as much as digits as its factorization.
125120381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 125120381 is about 11185.7221939399. The cubic root of 125120381 is about 500.1604565019.
The spelling of 125120381 in words is "one hundred twenty-five million, one hundred twenty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •