Base | Representation |
---|---|
bin | 100001110110011111001… |
… | …111010100001101000001 |
3 | 22020101110021201010102012 |
4 | 201312133033110031001 |
5 | 301103124204240033 |
6 | 4540355231102305 |
7 | 330031421252036 |
oct | 41663717241501 |
9 | 8211407633365 |
10 | 2326248899393 |
11 | 817613949771 |
12 | 316a14071995 |
13 | 13b4975820c3 |
14 | 8083bb9738d |
15 | 4079ed08248 |
hex | 21d9f3d4341 |
2326248899393 has 2 divisors, whose sum is σ = 2326248899394. Its totient is φ = 2326248899392.
The previous prime is 2326248899389. The next prime is 2326248899437. The reversal of 2326248899393 is 3939988426232.
2326248899393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2311667853889 + 14581045504 = 1520417^2 + 120752^2 .
It is a cyclic number.
It is not a de Polignac number, because 2326248899393 - 22 = 2326248899389 is a prime.
It is a super-2 number, since 2×23262488993932 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2326248899363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1163124449696 + 1163124449697.
It is an arithmetic number, because the mean of its divisors is an integer number (1163124449697).
Almost surely, 22326248899393 is an apocalyptic number.
It is an amenable number.
2326248899393 is a deficient number, since it is larger than the sum of its proper divisors (1).
2326248899393 is an equidigital number, since it uses as much as digits as its factorization.
2326248899393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 241864704, while the sum is 68.
The spelling of 2326248899393 in words is "two trillion, three hundred twenty-six billion, two hundred forty-eight million, eight hundred ninety-nine thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •