Base | Representation |
---|---|
bin | 111001111100000011… |
… | …0000101111110111111 |
3 | 102220011010212120220201 |
4 | 1303320012011332333 |
5 | 4014303341244411 |
6 | 133054115024331 |
7 | 11663164500316 |
oct | 1637006057677 |
9 | 386133776821 |
10 | 124421431231 |
11 | 48848721919 |
12 | 2014459b0a7 |
13 | b96b212076 |
14 | 604463d27d |
15 | 33832243c1 |
hex | 1cf8185fbf |
124421431231 has 2 divisors, whose sum is σ = 124421431232. Its totient is φ = 124421431230.
The previous prime is 124421431157. The next prime is 124421431261. The reversal of 124421431231 is 132134124421.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 124421431231 - 27 = 124421431103 is a prime.
It is a super-2 number, since 2×1244214312312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 124421431231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124421431261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62210715615 + 62210715616.
It is an arithmetic number, because the mean of its divisors is an integer number (62210715616).
Almost surely, 2124421431231 is an apocalyptic number.
124421431231 is a deficient number, since it is larger than the sum of its proper divisors (1).
124421431231 is an equidigital number, since it uses as much as digits as its factorization.
124421431231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4608, while the sum is 28.
Adding to 124421431231 its reverse (132134124421), we get a palindrome (256555555652).
The spelling of 124421431231 in words is "one hundred twenty-four billion, four hundred twenty-one million, four hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •