Base | Representation |
---|---|
bin | 111101111100100111… |
… | …0011001011110000001 |
3 | 110201101010000110011221 |
4 | 1323321032121132001 |
5 | 4134421230220001 |
6 | 141040245235041 |
7 | 12416421030355 |
oct | 1737116313601 |
9 | 421333013157 |
10 | 133030320001 |
11 | 51466169427 |
12 | 21947702a81 |
13 | c7109438a7 |
14 | 661db25465 |
15 | 36d8de61a1 |
hex | 1ef9399781 |
133030320001 has 4 divisors (see below), whose sum is σ = 133031291904. Its totient is φ = 133029348100.
The previous prime is 133030319987. The next prime is 133030320019. The reversal of 133030320001 is 100023030331.
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 a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 100023030331 = 7 ⋅14289004333.
It is a cyclic number.
It is not a de Polignac number, because 133030320001 - 25 = 133030319969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133030324001) 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, 238705 + ... + 568366.
It is an arithmetic number, because the mean of its divisors is an integer number (33257822976).
Almost surely, 2133030320001 is an apocalyptic number.
It is an amenable number.
133030320001 is a deficient number, since it is larger than the sum of its proper divisors (971903).
133030320001 is an equidigital number, since it uses as much as digits as its factorization.
133030320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971902.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 133030320001 its reverse (100023030331), we get a palindrome (233053350332).
The spelling of 133030320001 in words is "one hundred thirty-three billion, thirty million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •