Base | Representation |
---|---|
bin | 111110000010100100… |
… | …0100010110100001101 |
3 | 110201220000221221022002 |
4 | 1330011020202310031 |
5 | 4140323402041023 |
6 | 141112143402045 |
7 | 12424365160355 |
oct | 1740510426415 |
9 | 421800857262 |
10 | 133230112013 |
11 | 51558a1a099 |
12 | 219a25b3325 |
13 | c74315730b |
14 | 663c491b65 |
15 | 36eb70db28 |
hex | 1f05222d0d |
133230112013 has 4 divisors (see below), whose sum is σ = 133283342688. Its totient is φ = 133176881340.
The previous prime is 133230111991. The next prime is 133230112033. The reversal of 133230112013 is 310211032331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310211032331 = 7477 ⋅41488703.
It is a cyclic number.
It is not a de Polignac number, because 133230112013 - 214 = 133230095629 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133230112033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26611583 + ... + 26616588.
It is an arithmetic number, because the mean of its divisors is an integer number (33320835672).
Almost surely, 2133230112013 is an apocalyptic number.
It is an amenable number.
133230112013 is a deficient number, since it is larger than the sum of its proper divisors (53230675).
133230112013 is an equidigital number, since it uses as much as digits as its factorization.
133230112013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53230674.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 133230112013 its reverse (310211032331), we get a palindrome (443441144344).
The spelling of 133230112013 in words is "one hundred thirty-three billion, two hundred thirty million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •