Base | Representation |
---|---|
bin | 100001110011110101110… |
… | …100001101111100100101 |
3 | 22020010010012010112220102 |
4 | 201303311310031330211 |
5 | 301031314022240443 |
6 | 4535205211313445 |
7 | 326601114641015 |
oct | 41636564157445 |
9 | 8203105115812 |
10 | 2323406446373 |
11 | 816395405741 |
12 | 31636014b885 |
13 | 13b13370c93c |
14 | 8064c481c45 |
15 | 406854d4cb8 |
hex | 21cf5d0df25 |
2323406446373 has 2 divisors, whose sum is σ = 2323406446374. Its totient is φ = 2323406446372.
The previous prime is 2323406446307. The next prime is 2323406446379. The reversal of 2323406446373 is 3736446043232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1770051967489 + 553354478884 = 1330433^2 + 743878^2 .
It is a cyclic number.
It is not a de Polignac number, because 2323406446373 - 222 = 2323402252069 is a prime.
It is a super-2 number, since 2×23234064463732 (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 (2323406446379) 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, 1161703223186 + 1161703223187.
It is an arithmetic number, because the mean of its divisors is an integer number (1161703223187).
Almost surely, 22323406446373 is an apocalyptic number.
It is an amenable number.
2323406446373 is a deficient number, since it is larger than the sum of its proper divisors (1).
2323406446373 is an equidigital number, since it uses as much as digits as its factorization.
2323406446373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5225472, while the sum is 47.
The spelling of 2323406446373 in words is "two trillion, three hundred twenty-three billion, four hundred six million, four hundred forty-six thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •