Base | Representation |
---|---|
bin | 111101111100010011… |
… | …1111010011100010011 |
3 | 110201100102000220021122 |
4 | 1323320213322130103 |
5 | 4134411134401233 |
6 | 141035245112455 |
7 | 12416236211561 |
oct | 1737047723423 |
9 | 421312026248 |
10 | 133020231443 |
11 | 514604a8780 |
12 | 2194425872b |
13 | c70b820928 |
14 | 661c65aa31 |
15 | 36d80a1d98 |
hex | 1ef89fa713 |
133020231443 has 8 divisors (see below), whose sum is σ = 145752246720. Its totient is φ = 120394760680.
The previous prime is 133020231439. The next prime is 133020231451. The reversal of 133020231443 is 344132020331.
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 133020231443 - 22 = 133020231439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133020234443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26633513 + ... + 26638506.
It is an arithmetic number, because the mean of its divisors is an integer number (18219030840).
Almost surely, 2133020231443 is an apocalyptic number.
133020231443 is a deficient number, since it is larger than the sum of its proper divisors (12732015277).
133020231443 is a wasteful number, since it uses less digits than its factorization.
133020231443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53272257.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 133020231443 its reverse (344132020331), we get a palindrome (477152251774).
It can be divided in two parts, 133020 and 231443, that added together give a palindrome (364463).
The spelling of 133020231443 in words is "one hundred thirty-three billion, twenty million, two hundred thirty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •