Base | Representation |
---|---|
bin | 111101111110101110… |
… | …1010001111001100111 |
3 | 110201120001122010121202 |
4 | 1323331131101321213 |
5 | 4140042420030043 |
6 | 141051303233115 |
7 | 12421242431564 |
oct | 1737535217147 |
9 | 421501563552 |
10 | 133101330023 |
11 | 514a225a2a2 |
12 | 2196744879b |
13 | c72257705c |
14 | 662932b86b |
15 | 36e02711b8 |
hex | 1efd751e67 |
133101330023 has 8 divisors (see below), whose sum is σ = 136352492640. Its totient is φ = 129850395520.
The previous prime is 133101330013. The next prime is 133101330029. The reversal of 133101330023 is 320033101331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133101330023 - 24 = 133101330007 is a prime.
It is a super-2 number, since 2×1331013300232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133101329977 and 133101330004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133101330029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2230763 + ... + 2289651.
It is an arithmetic number, because the mean of its divisors is an integer number (17044061580).
Almost surely, 2133101330023 is an apocalyptic number.
133101330023 is a deficient number, since it is larger than the sum of its proper divisors (3251162617).
133101330023 is an equidigital number, since it uses as much as digits as its factorization.
133101330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114057.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 133101330023 its reverse (320033101331), we get a palindrome (453134431354).
The spelling of 133101330023 in words is "one hundred thirty-three billion, one hundred one million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •