Base | Representation |
---|---|
bin | 111101111100100110… |
… | …1101011110100011111 |
3 | 110201101002122221200211 |
4 | 1323321031223310133 |
5 | 4134421203224043 |
6 | 141040241233251 |
7 | 12416416321264 |
oct | 1737115536437 |
9 | 421332587624 |
10 | 133030133023 |
11 | 514660509a7 |
12 | 21947632827 |
13 | c7108a9758 |
14 | 661dab726b |
15 | 36d8daaa9d |
hex | 1ef936bd1f |
133030133023 has 4 divisors (see below), whose sum is σ = 133035949728. Its totient is φ = 133024316320.
The previous prime is 133030133017. The next prime is 133030133029. The reversal of 133030133023 is 320331030331.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (133030133017) and next prime (133030133029).
It is a cyclic number.
It is not a de Polignac number, because 133030133023 - 29 = 133030132511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133030132985 and 133030133003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133030133029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2873911 + ... + 2919832.
It is an arithmetic number, because the mean of its divisors is an integer number (33258987432).
Almost surely, 2133030133023 is an apocalyptic number.
133030133023 is a deficient number, since it is larger than the sum of its proper divisors (5816705).
133030133023 is an equidigital number, since it uses as much as digits as its factorization.
133030133023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5816704.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 133030133023 its reverse (320331030331), we get a palindrome (453361163354).
The spelling of 133030133023 in words is "one hundred thirty-three billion, thirty million, one hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •