Base | Representation |
---|---|
bin | 11110010011110001100000… |
… | …011100001100010110100111 |
3 | 122110222101011201211021020020 |
4 | 132103301200130030112213 |
5 | 114432442324042031043 |
6 | 1151301135502210223 |
7 | 40035423535320000 |
oct | 3623614034142647 |
9 | 573871151737206 |
10 | 133300223002023 |
11 | 395233418339a0 |
12 | 12b4a586b83973 |
13 | 594c20719293c |
14 | 24cba9da861a7 |
15 | 10626a0d4ae83 |
hex | 793c6070c5a7 |
133300223002023 has 40 divisors (see below), whose sum is σ = 226192980107136. Its totient is φ = 69246869050800.
The previous prime is 133300223002013. The next prime is 133300223002049. The reversal of 133300223002023 is 320200322003331.
It is not a de Polignac number, because 133300223002023 - 29 = 133300223001511 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133300223001984 and 133300223002002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133300223002013) 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 in 39 ways as a sum of consecutive naturals, for example, 841112083 + ... + 841270548.
Almost surely, 2133300223002023 is an apocalyptic number.
133300223002023 is a deficient number, since it is larger than the sum of its proper divisors (92892757105113).
133300223002023 is an equidigital number, since it uses as much as digits as its factorization.
133300223002023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1682382673 (or 1682382652 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 133300223002023 its reverse (320200322003331), we get a palindrome (453500545005354).
The spelling of 133300223002023 in words is "one hundred thirty-three trillion, three hundred billion, two hundred twenty-three million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •