Base | Representation |
---|---|
bin | 111101111111011000… |
… | …1000110001010001111 |
3 | 110201121120222102112211 |
4 | 1323332301012022033 |
5 | 4140114031131111 |
6 | 141053410211251 |
7 | 12421630253116 |
oct | 1737661061217 |
9 | 421546872484 |
10 | 133123302031 |
11 | 515036a7185 |
12 | 21972883b27 |
13 | c726c9ac45 |
14 | 662c20ac7d |
15 | 36e2161521 |
hex | 1efec4628f |
133123302031 has 8 divisors (see below), whose sum is σ = 135175761920. Its totient is φ = 131080026168.
The previous prime is 133123302023. The next prime is 133123302089. The reversal of 133123302031 is 130203321331.
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 133123302031 - 23 = 133123302023 is a prime.
It is a super-2 number, since 2×1331233020312 (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 = 133123301993 and 133123302011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133123302131) 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, 2266791 + ... + 2324776.
It is an arithmetic number, because the mean of its divisors is an integer number (16896970240).
Almost surely, 2133123302031 is an apocalyptic number.
133123302031 is a deficient number, since it is larger than the sum of its proper divisors (2052459889).
133123302031 is an equidigital number, since it uses as much as digits as its factorization.
133123302031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4592013.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 133123302031 its reverse (130203321331), we get a palindrome (263326623362).
The spelling of 133123302031 in words is "one hundred thirty-three billion, one hundred twenty-three million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •