Base | Representation |
---|---|
bin | 111110000101100101… |
… | …0001111011000111111 |
3 | 110202011002012202102111 |
4 | 1330023022033120333 |
5 | 4141030243020111 |
6 | 141130154434451 |
7 | 12430033446052 |
oct | 1741312173077 |
9 | 422132182374 |
10 | 133331220031 |
11 | 515aaaa8039 |
12 | 21a10432a27 |
13 | c75b098249 |
14 | 664ba90a99 |
15 | 3705531a21 |
hex | 1f0b28f63f |
133331220031 has 8 divisors (see below), whose sum is σ = 141537155760. Its totient is φ = 125165609088.
The previous prime is 133331219981. The next prime is 133331220059. The reversal of 133331220031 is 130022133331.
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 133331220031 - 217 = 133331088959 is a prime.
It is a super-2 number, since 2×1333312200312 (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 = 133331219984 and 133331220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133331260031) 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, 10074381 + ... + 10087606.
It is an arithmetic number, because the mean of its divisors is an integer number (17692144470).
Almost surely, 2133331220031 is an apocalyptic number.
133331220031 is a deficient number, since it is larger than the sum of its proper divisors (8205935729).
133331220031 is a wasteful number, since it uses less digits than its factorization.
133331220031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20162393.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 133331220031 its reverse (130022133331), we get a palindrome (263353353362).
The spelling of 133331220031 in words is "one hundred thirty-three billion, three hundred thirty-one million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •