Base | Representation |
---|---|
bin | 111110000101000000… |
… | …1010011011100100011 |
3 | 110202002202020100212001 |
4 | 1330022001103130203 |
5 | 4141010344201011 |
6 | 141124232544431 |
7 | 12426412103650 |
oct | 1741201233443 |
9 | 422082210761 |
10 | 133312100131 |
11 | 515a0228a71 |
12 | 21a05b52117 |
13 | c7571325b2 |
14 | 6649314c27 |
15 | 3703a067c1 |
hex | 1f0a053723 |
133312100131 has 16 divisors (see below), whose sum is σ = 161489327616. Its totient is φ = 107432240256.
The previous prime is 133312100107. The next prime is 133312100191. The reversal of 133312100131 is 131001213331.
It is a cyclic number.
It is not a de Polignac number, because 133312100131 - 211 = 133312098083 is a prime.
It is a super-2 number, since 2×1333121001312 (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 = 133312100099 and 133312100108.
It is not an unprimeable number, because it can be changed into a prime (133312100191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 478791 + ... + 704176.
It is an arithmetic number, because the mean of its divisors is an integer number (10093082976).
Almost surely, 2133312100131 is an apocalyptic number.
133312100131 is a deficient number, since it is larger than the sum of its proper divisors (28177227485).
133312100131 is a wasteful number, since it uses less digits than its factorization.
133312100131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1183938.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 133312100131 its reverse (131001213331), we get a palindrome (264313313462).
The spelling of 133312100131 in words is "one hundred thirty-three billion, three hundred twelve million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •