Base | Representation |
---|---|
bin | 1011001101011111001001… |
… | …0010100001101011010011 |
3 | 1121122101101212020100011212 |
4 | 2303113302102201223103 |
5 | 3103423303441140102 |
6 | 42114345215130335 |
7 | 2411355565144661 |
oct | 263276222415323 |
9 | 47571355210155 |
10 | 12326326115027 |
11 | 3a22624821a61 |
12 | 1470b118139ab |
13 | 6b54a1704542 |
14 | 308851265c31 |
15 | 1659818eec52 |
hex | b35f24a1ad3 |
12326326115027 has 2 divisors, whose sum is σ = 12326326115028. Its totient is φ = 12326326115026.
The previous prime is 12326326115021. The next prime is 12326326115029. The reversal of 12326326115027 is 72051162362321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12326326115027 - 222 = 12326321920723 is a prime.
It is a super-2 number, since 2×123263261150272 (a number of 27 digits) contains 22 as substring.
Together with 12326326115029, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12326326115021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6163163057513 + 6163163057514.
It is an arithmetic number, because the mean of its divisors is an integer number (6163163057514).
Almost surely, 212326326115027 is an apocalyptic number.
12326326115027 is a deficient number, since it is larger than the sum of its proper divisors (1).
12326326115027 is an equidigital number, since it uses as much as digits as its factorization.
12326326115027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 41.
Adding to 12326326115027 its reverse (72051162362321), we get a palindrome (84377488477348).
The spelling of 12326326115027 in words is "twelve trillion, three hundred twenty-six billion, three hundred twenty-six million, one hundred fifteen thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •