Base | Representation |
---|---|
bin | 111110000101100011… |
… | …0101111000001100111 |
3 | 110202011000111001210110 |
4 | 1330023012233001213 |
5 | 4141030024113111 |
6 | 141130123024103 |
7 | 12430022600544 |
oct | 1741306570147 |
9 | 422130431713 |
10 | 133330301031 |
11 | 515aa52a634 |
12 | 21a1006b033 |
13 | c75ab35b65 |
14 | 664b8d1bcb |
15 | 37053ee5a6 |
hex | 1f0b1af067 |
133330301031 has 8 divisors (see below), whose sum is σ = 180427074304. Its totient is φ = 87560197560.
The previous prime is 133330301029. The next prime is 133330301047. The reversal of 133330301031 is 130103033331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133330301031 - 21 = 133330301029 is a prime.
It is a super-2 number, since 2×1333303010312 (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 = 133330300989 and 133330301007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133330301131) 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, 331667215 + ... + 331667616.
It is an arithmetic number, because the mean of its divisors is an integer number (22553384288).
Almost surely, 2133330301031 is an apocalyptic number.
133330301031 is a deficient number, since it is larger than the sum of its proper divisors (47096773273).
133330301031 is an equidigital number, since it uses as much as digits as its factorization.
133330301031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 663334901.
The product of its (nonzero) digits is 729, while the sum is 21.
Adding to 133330301031 its reverse (130103033331), we get a palindrome (263433334362).
The spelling of 133330301031 in words is "one hundred thirty-three billion, three hundred thirty million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •