Base | Representation |
---|---|
bin | 100001101010011000101… |
… | …001100010100010010011 |
3 | 22012010220121102221202102 |
4 | 201222120221202202103 |
5 | 300400020334301233 |
6 | 4530405521111015 |
7 | 326061401511263 |
oct | 41523051424223 |
9 | 8163817387672 |
10 | 2313253431443 |
11 | 81205528a309 |
12 | 3143a7a8846b |
13 | 13a1a61091b6 |
14 | 7dd67c8b7a3 |
15 | 4028de9e1e8 |
hex | 21a98a62893 |
2313253431443 has 2 divisors, whose sum is σ = 2313253431444. Its totient is φ = 2313253431442.
The previous prime is 2313253431439. The next prime is 2313253431469. The reversal of 2313253431443 is 3441343523132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2313253431443 - 22 = 2313253431439 is a prime.
It is a super-2 number, since 2×23132534314432 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2313253431397 and 2313253431406.
It is not a weakly prime, because it can be changed into another prime (2313253431143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1156626715721 + 1156626715722.
It is an arithmetic number, because the mean of its divisors is an integer number (1156626715722).
Almost surely, 22313253431443 is an apocalyptic number.
2313253431443 is a deficient number, since it is larger than the sum of its proper divisors (1).
2313253431443 is an equidigital number, since it uses as much as digits as its factorization.
2313253431443 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 311040, while the sum is 38.
Adding to 2313253431443 its reverse (3441343523132), we get a palindrome (5754596954575).
The spelling of 2313253431443 in words is "two trillion, three hundred thirteen billion, two hundred fifty-three million, four hundred thirty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •