Base | Representation |
---|---|
bin | 111110000101001111… |
… | …1110101000110011101 |
3 | 110202010022021220202201 |
4 | 1330022133311012131 |
5 | 4141014421233201 |
6 | 141125120251501 |
7 | 12426540112621 |
oct | 1741237650635 |
9 | 422108256681 |
10 | 133320102301 |
11 | 515a47a4131 |
12 | 21a08770b91 |
13 | c7589a49c9 |
14 | 664a3d9181 |
15 | 3704587801 |
hex | 1f0a7f519d |
133320102301 has 4 divisors (see below), whose sum is σ = 139116628512. Its totient is φ = 127523576092.
The previous prime is 133320102211. The next prime is 133320102341. The reversal of 133320102301 is 103201023331.
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: 103201023331 = 7 ⋅14743003333.
It is a cyclic number.
It is not a de Polignac number, because 133320102301 - 225 = 133286547869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133320102341) 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, 2898263071 + ... + 2898263116.
It is an arithmetic number, because the mean of its divisors is an integer number (34779157128).
Almost surely, 2133320102301 is an apocalyptic number.
It is an amenable number.
133320102301 is a deficient number, since it is larger than the sum of its proper divisors (5796526211).
133320102301 is an equidigital number, since it uses as much as digits as its factorization.
133320102301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5796526210.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 133320102301 its reverse (103201023331), we get a palindrome (236521125632).
The spelling of 133320102301 in words is "one hundred thirty-three billion, three hundred twenty million, one hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •