Base | Representation |
---|---|
bin | 1000100010011000011… |
… | …0000001001110000101 |
3 | 112000120112201101100002 |
4 | 2020212012001032011 |
5 | 4400334002001013 |
6 | 151213420131045 |
7 | 13411366300634 |
oct | 2104606011605 |
9 | 460515641302 |
10 | 146668000133 |
11 | 57224298356 |
12 | 24512996a85 |
13 | 10aa5174ac5 |
14 | 715504551b |
15 | 3c3630a358 |
hex | 2226181385 |
146668000133 has 8 divisors (see below), whose sum is σ = 153250869888. Its totient is φ = 140102297104.
The previous prime is 146668000103. The next prime is 146668000139. The reversal of 146668000133 is 331000866641.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146668000133 - 210 = 146667999109 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 (146668000139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4274210 + ... + 4308387.
It is an arithmetic number, because the mean of its divisors is an integer number (19156358736).
Almost surely, 2146668000133 is an apocalyptic number.
It is an amenable number.
146668000133 is a deficient number, since it is larger than the sum of its proper divisors (6582869755).
146668000133 is an equidigital number, since it uses as much as digits as its factorization.
146668000133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8583363.
The product of its (nonzero) digits is 62208, while the sum is 38.
Adding to 146668000133 its reverse (331000866641), we get a palindrome (477668866774).
The spelling of 146668000133 in words is "one hundred forty-six billion, six hundred sixty-eight million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •