Base | Representation |
---|---|
bin | 111101111110101000… |
… | …0001100011000110101 |
3 | 110201112211011211221001 |
4 | 1323331100030120311 |
5 | 4140041030241243 |
6 | 141051101523301 |
7 | 12421201323352 |
oct | 1737520143065 |
9 | 421484154831 |
10 | 133097899573 |
11 | 514a0326a11 |
12 | 21966273531 |
13 | c7219457c2 |
14 | 6628ab7629 |
15 | 36dece4a4d |
hex | 1efd40c635 |
133097899573 has 12 divisors (see below), whose sum is σ = 136879431780. Its totient is φ = 129420769680.
The previous prime is 133097899567. The next prime is 133097899591. The reversal of 133097899573 is 375998790331.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 6 ways, for example, as 39163618404 + 93934281169 = 197898^2 + 306487^2 .
It is not a de Polignac number, because 133097899573 - 221 = 133095802421 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 (133097899073) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82107703 + ... + 82109323.
It is an arithmetic number, because the mean of its divisors is an integer number (11406619315).
Almost surely, 2133097899573 is an apocalyptic number.
It is an amenable number.
133097899573 is a deficient number, since it is larger than the sum of its proper divisors (3781532207).
133097899573 is an frugal number, since it uses more digits than its factorization.
133097899573 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3353 (or 1658 counting only the distinct ones).
The product of its (nonzero) digits is 38578680, while the sum is 64.
The spelling of 133097899573 in words is "one hundred thirty-three billion, ninety-seven million, eight hundred ninety-nine thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •