Base | Representation |
---|---|
bin | 111010001011111110… |
… | …1000010100000010001 |
3 | 102221112101121212110022 |
4 | 1310113331002200101 |
5 | 4021402204203333 |
6 | 133223131113225 |
7 | 12012344603546 |
oct | 1642775024021 |
9 | 387471555408 |
10 | 124955928593 |
11 | 48aa2400681 |
12 | 202735a2815 |
13 | ba24b851b2 |
14 | 6095614bcd |
15 | 33b5103c98 |
hex | 1d17f42811 |
124955928593 has 2 divisors, whose sum is σ = 124955928594. Its totient is φ = 124955928592.
The previous prime is 124955928551. The next prime is 124955928611. The reversal of 124955928593 is 395829559421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94182699664 + 30773228929 = 306892^2 + 175423^2 .
It is an emirp because it is prime and its reverse (395829559421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 124955928593 - 28 = 124955928337 is a prime.
It is a super-2 number, since 2×1249559285932 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (124955928193) 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, 62477964296 + 62477964297.
It is an arithmetic number, because the mean of its divisors is an integer number (62477964297).
Almost surely, 2124955928593 is an apocalyptic number.
It is an amenable number.
124955928593 is a deficient number, since it is larger than the sum of its proper divisors (1).
124955928593 is an equidigital number, since it uses as much as digits as its factorization.
124955928593 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34992000, while the sum is 62.
The spelling of 124955928593 in words is "one hundred twenty-four billion, nine hundred fifty-five million, nine hundred twenty-eight thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •