Base | Representation |
---|---|
bin | 111101111100100110… |
… | …1001110111001001101 |
3 | 110201101002102221011121 |
4 | 1323321031032321031 |
5 | 4134421140431131 |
6 | 141040234520541 |
7 | 12416415315664 |
oct | 1737115167115 |
9 | 421332387147 |
10 | 133030014541 |
11 | 51465a7a986 |
12 | 21947596151 |
13 | c710867848 |
14 | 661da85ddb |
15 | 36d8d85911 |
hex | 1ef934ee4d |
133030014541 has 24 divisors (see below), whose sum is σ = 146091856680. Its totient is φ = 121029120000.
The previous prime is 133030014529. The next prime is 133030014569. The reversal of 133030014541 is 145410030331.
It can be written as a sum of positive squares in 12 ways, for example, as 37314648900 + 95715365641 = 193170^2 + 309379^2 .
It is not a de Polignac number, because 133030014541 - 231 = 130882530893 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 (133030014511) 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 23 ways as a sum of consecutive naturals, for example, 1240041 + ... + 1343041.
It is an arithmetic number, because the mean of its divisors is an integer number (6087160695).
Almost surely, 2133030014541 is an apocalyptic number.
It is an amenable number.
133030014541 is a deficient number, since it is larger than the sum of its proper divisors (13061842139).
133030014541 is a wasteful number, since it uses less digits than its factorization.
133030014541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103185 (or 103168 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 133030014541 its reverse (145410030331), we get a palindrome (278440044872).
The spelling of 133030014541 in words is "one hundred thirty-three billion, thirty million, fourteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •