Base | Representation |
---|---|
bin | 1011010011101010010101… |
… | …1100101001110100000001 |
3 | 1122000112020002212021120101 |
4 | 2310322211130221310001 |
5 | 3112143034220402221 |
6 | 42235212032442401 |
7 | 2422132510534405 |
oct | 264724534516401 |
9 | 48015202767511 |
10 | 12432411106561 |
11 | 3a63612a59286 |
12 | 14895993a9401 |
13 | 6c24a9a9a094 |
14 | 30da364db105 |
15 | 1685dee5ed91 |
hex | b4ea5729d01 |
12432411106561 has 2 divisors, whose sum is σ = 12432411106562. Its totient is φ = 12432411106560.
The previous prime is 12432411106547. The next prime is 12432411106589. The reversal of 12432411106561 is 16560111423421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6313560782400 + 6118850324161 = 2512680^2 + 2473631^2 .
It is a cyclic number.
It is not a de Polignac number, because 12432411106561 - 211 = 12432411104513 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12432411106561.
It is not a weakly prime, because it can be changed into another prime (12432411106861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6216205553280 + 6216205553281.
It is an arithmetic number, because the mean of its divisors is an integer number (6216205553281).
Almost surely, 212432411106561 is an apocalyptic number.
It is an amenable number.
12432411106561 is a deficient number, since it is larger than the sum of its proper divisors (1).
12432411106561 is an equidigital number, since it uses as much as digits as its factorization.
12432411106561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 37.
Adding to 12432411106561 its reverse (16560111423421), we get a palindrome (28992522529982).
The spelling of 12432411106561 in words is "twelve trillion, four hundred thirty-two billion, four hundred eleven million, one hundred six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •