Base | Representation |
---|---|
bin | 1011000001101111011001… |
… | …1100110011011111111111 |
3 | 1120221002112111212022021021 |
4 | 2300123312130303133333 |
5 | 3042122020302033143 |
6 | 41441533332445011 |
7 | 2360653134301453 |
oct | 260336634633777 |
9 | 46832474768237 |
10 | 12124532455423 |
11 | 3954a92537853 |
12 | 1439995479767 |
13 | 69c45290522b |
14 | 2dcb8ac7c663 |
15 | 1605c0c75ced |
hex | b06f67337ff |
12124532455423 has 2 divisors, whose sum is σ = 12124532455424. Its totient is φ = 12124532455422.
The previous prime is 12124532455411. The next prime is 12124532455439. The reversal of 12124532455423 is 32455423542121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12124532455423 - 29 = 12124532454911 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12124532455423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12124532455403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6062266227711 + 6062266227712.
It is an arithmetic number, because the mean of its divisors is an integer number (6062266227712).
Almost surely, 212124532455423 is an apocalyptic number.
12124532455423 is a deficient number, since it is larger than the sum of its proper divisors (1).
12124532455423 is an equidigital number, since it uses as much as digits as its factorization.
12124532455423 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152000, while the sum is 43.
Adding to 12124532455423 its reverse (32455423542121), we get a palindrome (44579955997544).
The spelling of 12124532455423 in words is "twelve trillion, one hundred twenty-four billion, five hundred thirty-two million, four hundred fifty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •