Base | Representation |
---|---|
bin | 100001110100011010100… |
… | …100010101110001011001 |
3 | 22020011201011100210212122 |
4 | 201310122210111301121 |
5 | 301034044344303423 |
6 | 4535350315151025 |
7 | 326622312624224 |
oct | 41643244256131 |
9 | 8204634323778 |
10 | 2324023041113 |
11 | 816681468474 |
12 | 3164b2745475 |
13 | 13b2013989b7 |
14 | 806aa3085bb |
15 | 406be6ce8c8 |
hex | 21d1a915c59 |
2324023041113 has 2 divisors, whose sum is σ = 2324023041114. Its totient is φ = 2324023041112.
The previous prime is 2324023041103. The next prime is 2324023041143. The reversal of 2324023041113 is 3111403204232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2287317462544 + 36705578569 = 1512388^2 + 191587^2 .
It is a cyclic number.
It is not a de Polignac number, because 2324023041113 - 218 = 2324022778969 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2324023041103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1162011520556 + 1162011520557.
It is an arithmetic number, because the mean of its divisors is an integer number (1162011520557).
Almost surely, 22324023041113 is an apocalyptic number.
It is an amenable number.
2324023041113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2324023041113 is an equidigital number, since it uses as much as digits as its factorization.
2324023041113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 2324023041113 its reverse (3111403204232), we get a palindrome (5435426245345).
The spelling of 2324023041113 in words is "two trillion, three hundred twenty-four billion, twenty-three million, forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •