Base | Representation |
---|---|
bin | 1011111011110101001101… |
… | …0001111100011111010111 |
3 | 1201110111112010211101020012 |
4 | 2332331103101330133113 |
5 | 3204444411202134143 |
6 | 43524223054430435 |
7 | 2523033223111232 |
oct | 276752321743727 |
9 | 51414463741205 |
10 | 13122522302423 |
11 | 41aa259810a76 |
12 | 157b29620241b |
13 | 7425aa5b0311 |
14 | 3351c2346419 |
15 | 17b530cc1418 |
hex | bef5347c7d7 |
13122522302423 has 2 divisors, whose sum is σ = 13122522302424. Its totient is φ = 13122522302422.
The previous prime is 13122522302399. The next prime is 13122522302443. The reversal of 13122522302423 is 32420322522131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13122522302423 - 226 = 13122455193559 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13122522302423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13122522302443) 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, 6561261151211 + 6561261151212.
It is an arithmetic number, because the mean of its divisors is an integer number (6561261151212).
Almost surely, 213122522302423 is an apocalyptic number.
13122522302423 is a deficient number, since it is larger than the sum of its proper divisors (1).
13122522302423 is an equidigital number, since it uses as much as digits as its factorization.
13122522302423 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 32.
Adding to 13122522302423 its reverse (32420322522131), we get a palindrome (45542844824554).
The spelling of 13122522302423 in words is "thirteen trillion, one hundred twenty-two billion, five hundred twenty-two million, three hundred two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •