Base | Representation |
---|---|
bin | 111110000100110001… |
… | …0100001001110111101 |
3 | 110202002012001100220112 |
4 | 1330021202201032331 |
5 | 4141001312431031 |
6 | 141123343555405 |
7 | 12426253363202 |
oct | 1741142411675 |
9 | 422065040815 |
10 | 133304030141 |
11 | 51596716957 |
12 | 21a032bbb65 |
13 | c755568359 |
14 | 6648213ca9 |
15 | 3702e6062b |
hex | 1f098a13bd |
133304030141 has 4 divisors (see below), whose sum is σ = 133311948384. Its totient is φ = 133296111900.
The previous prime is 133304030137. The next prime is 133304030149. The reversal of 133304030141 is 141030403331.
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.
It is a cyclic number.
It is not a de Polignac number, because 133304030141 - 22 = 133304030137 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 (133304030149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3933815 + ... + 3967556.
It is an arithmetic number, because the mean of its divisors is an integer number (33327987096).
Almost surely, 2133304030141 is an apocalyptic number.
It is an amenable number.
133304030141 is a deficient number, since it is larger than the sum of its proper divisors (7918243).
133304030141 is an equidigital number, since it uses as much as digits as its factorization.
133304030141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7918242.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 133304030141 its reverse (141030403331), we get a palindrome (274334433472).
The spelling of 133304030141 in words is "one hundred thirty-three billion, three hundred four million, thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •