Base | Representation |
---|---|
bin | 1011010100001010110011… |
… | …0010100110010001101111 |
3 | 1122001100201100011000220001 |
4 | 2311002230302212101233 |
5 | 3112313410300444401 |
6 | 42243212405205131 |
7 | 2422561441103341 |
oct | 265025462462157 |
9 | 48040640130801 |
10 | 12441124234351 |
11 | 3a6728432213a |
12 | 148b20b4007a7 |
13 | 6c3267c979b7 |
14 | 310221799291 |
15 | 16894ed72601 |
hex | b50acca646f |
12441124234351 has 2 divisors, whose sum is σ = 12441124234352. Its totient is φ = 12441124234350.
The previous prime is 12441124234313. The next prime is 12441124234387. The reversal of 12441124234351 is 15343242114421.
12441124234351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12441124234351 - 27 = 12441124234223 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12441124234351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12441124234391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6220562117175 + 6220562117176.
It is an arithmetic number, because the mean of its divisors is an integer number (6220562117176).
Almost surely, 212441124234351 is an apocalyptic number.
12441124234351 is a deficient number, since it is larger than the sum of its proper divisors (1).
12441124234351 is an equidigital number, since it uses as much as digits as its factorization.
12441124234351 is an evil number, because the sum of its binary digits is even.
The product of its digits is 92160, while the sum is 37.
Adding to 12441124234351 its reverse (15343242114421), we get a palindrome (27784366348772).
The spelling of 12441124234351 in words is "twelve trillion, four hundred forty-one billion, one hundred twenty-four million, two hundred thirty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •