Base | Representation |
---|---|
bin | 11110001111110001011101… |
… | …110001100000101000110101 |
3 | 122110000002112220100120220000 |
4 | 132033301131301200220311 |
5 | 114413441303342222131 |
6 | 1150530551311501513 |
7 | 40006521644332443 |
oct | 3617613561405065 |
9 | 573002486316800 |
10 | 133025300351541 |
11 | 394277930a4544 |
12 | 12b0523bb27899 |
13 | 592c3029103b0 |
14 | 24bc65d2a3b93 |
15 | 105a46003cce6 |
hex | 78fc5dc60a35 |
133025300351541 has 40 divisors (see below), whose sum is σ = 214031448870624. Its totient is φ = 81850731789600.
The previous prime is 133025300351533. The next prime is 133025300351609. The reversal of 133025300351541 is 145153003520331.
133025300351541 is a `hidden beast` number, since 1 + 3 + 3 + 0 + 253 + 0 + 0 + 351 + 54 + 1 = 666.
It is not a de Polignac number, because 133025300351541 - 23 = 133025300351533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133025300351496 and 133025300351505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133025300351501) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 631471 + ... + 16323276.
Almost surely, 2133025300351541 is an apocalyptic number.
It is an amenable number.
133025300351541 is a deficient number, since it is larger than the sum of its proper divisors (81006148519083).
133025300351541 is a wasteful number, since it uses less digits than its factorization.
133025300351541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16962223 (or 16962214 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 36.
Adding to 133025300351541 its reverse (145153003520331), we get a palindrome (278178303871872).
The spelling of 133025300351541 in words is "one hundred thirty-three trillion, twenty-five billion, three hundred million, three hundred fifty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •