Base | Representation |
---|---|
bin | 1100000110111000010001… |
… | …0110011011001101001111 |
3 | 1202010122102202102210101012 |
4 | 3001232010112123031033 |
5 | 3221102114433341143 |
6 | 44151333002235435 |
7 | 2542532542003145 |
oct | 301560426331517 |
9 | 52118382383335 |
10 | 13312324121423 |
11 | 42727a7a07908 |
12 | 15b00264b5b7b |
13 | 757467b43962 |
14 | 340469c37595 |
15 | 18143dc8c418 |
hex | c1b8459b34f |
13312324121423 has 2 divisors, whose sum is σ = 13312324121424. Its totient is φ = 13312324121422.
The previous prime is 13312324121401. The next prime is 13312324121429. The reversal of 13312324121423 is 32412142321331.
13312324121423 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 13312324121423 - 218 = 13312323859279 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13312324121423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13312324121429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6656162060711 + 6656162060712.
It is an arithmetic number, because the mean of its divisors is an integer number (6656162060712).
Almost surely, 213312324121423 is an apocalyptic number.
13312324121423 is a deficient number, since it is larger than the sum of its proper divisors (1).
13312324121423 is an equidigital number, since it uses as much as digits as its factorization.
13312324121423 is an evil number, because the sum of its binary digits is even.
The product of its digits is 20736, while the sum is 32.
Adding to 13312324121423 its reverse (32412142321331), we get a palindrome (45724466442754).
The spelling of 13312324121423 in words is "thirteen trillion, three hundred twelve billion, three hundred twenty-four million, one hundred twenty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •