Base | Representation |
---|---|
bin | 100001110100011100011… |
… | …010111010110001011111 |
3 | 22020011210022212001212021 |
4 | 201310130122322301133 |
5 | 301034130324010123 |
6 | 4535353345321011 |
7 | 326623141060564 |
oct | 41643432726137 |
9 | 8204708761767 |
10 | 2324054125663 |
11 | 816697a69786 |
12 | 316501036167 |
13 | 13b20796051a |
14 | 806b04ba86b |
15 | 406c22bec5d |
hex | 21d1c6bac5f |
2324054125663 has 2 divisors, whose sum is σ = 2324054125664. Its totient is φ = 2324054125662.
The previous prime is 2324054125513. The next prime is 2324054125669. The reversal of 2324054125663 is 3665214504232.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2324054125663 is a prime.
It is a super-2 number, since 2×23240541256632 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2324054125669) 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, 1162027062831 + 1162027062832.
It is an arithmetic number, because the mean of its divisors is an integer number (1162027062832).
Almost surely, 22324054125663 is an apocalyptic number.
2324054125663 is a deficient number, since it is larger than the sum of its proper divisors (1).
2324054125663 is an equidigital number, since it uses as much as digits as its factorization.
2324054125663 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 43.
Adding to 2324054125663 its reverse (3665214504232), we get a palindrome (5989268629895).
The spelling of 2324054125663 in words is "two trillion, three hundred twenty-four billion, fifty-four million, one hundred twenty-five thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •