Base | Representation |
---|---|
bin | 100100101110010010111001… |
… | …0110101111101010000010111 |
3 | 1120100201121120002100002122022 |
4 | 1021130211302311331100113 |
5 | 314314343301230041043 |
6 | 3103002151515323355 |
7 | 125016402212563355 |
oct | 11134456265752027 |
9 | 1510647502302568 |
10 | 323022122112023 |
11 | 93a19a04843444 |
12 | 3028ba2715055b |
13 | 10b31b17453a59 |
14 | 59aa4d5a367d5 |
15 | 2752830138868 |
hex | 125c972d7d417 |
323022122112023 has 2 divisors, whose sum is σ = 323022122112024. Its totient is φ = 323022122112022.
The previous prime is 323022122111959. The next prime is 323022122112043. The reversal of 323022122112023 is 320211221220323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 323022122112023 - 26 = 323022122111959 is a prime.
It is a super-2 number, since 2×3230221221120232 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323022122111983 and 323022122112001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323022122112043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161511061056011 + 161511061056012.
It is an arithmetic number, because the mean of its divisors is an integer number (161511061056012).
Almost surely, 2323022122112023 is an apocalyptic number.
323022122112023 is a deficient number, since it is larger than the sum of its proper divisors (1).
323022122112023 is an equidigital number, since it uses as much as digits as its factorization.
323022122112023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 323022122112023 its reverse (320211221220323), we get a palindrome (643233343332346).
The spelling of 323022122112023 in words is "three hundred twenty-three trillion, twenty-two billion, one hundred twenty-two million, one hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •