Base | Representation |
---|---|
bin | 111101111100000110… |
… | …0101111111000100111 |
3 | 110201022220122002221000 |
4 | 1323320030233320213 |
5 | 4134402324012221 |
6 | 141034432324343 |
7 | 12416121532344 |
oct | 1737014577047 |
9 | 421286562830 |
10 | 133013110311 |
11 | 51457484544 |
12 | 219419a36b3 |
13 | c70a1c9543 |
14 | 661b7257cb |
15 | 36d7646e26 |
hex | 1ef832fe27 |
133013110311 has 16 divisors (see below), whose sum is σ = 197074771200. Its totient is φ = 88667166744.
The previous prime is 133013110309. The next prime is 133013110327. The reversal of 133013110311 is 113011310331.
133013110311 is a `hidden beast` number, since 1 + 330 + 13 + 1 + 10 + 311 = 666.
It is not a de Polignac number, because 133013110311 - 21 = 133013110309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133013117311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74350 + ... + 521108.
It is an arithmetic number, because the mean of its divisors is an integer number (12317173200).
Almost surely, 2133013110311 is an apocalyptic number.
133013110311 is a deficient number, since it is larger than the sum of its proper divisors (64061660889).
133013110311 is a wasteful number, since it uses less digits than its factorization.
133013110311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457795 (or 457789 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 133013110311 its reverse (113011310331), we get a palindrome (246024420642).
It can be divided in two parts, 1330 and 13110311, that added together give a square (13111641 = 36212).
The spelling of 133013110311 in words is "one hundred thirty-three billion, thirteen million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •