Base | Representation |
---|---|
bin | 11110001111101101011110… |
… | …101110110000111001110101 |
3 | 122102222200111200211110000000 |
4 | 132033231132232300321311 |
5 | 114413404022442113103 |
6 | 1150525002535541513 |
7 | 40006310626235502 |
oct | 3617553656607165 |
9 | 572880450743000 |
10 | 133021021441653 |
11 | 39425997831184 |
12 | 12b04446b2a899 |
13 | 592baa0296557 |
14 | 24bc374caa4a9 |
15 | 105a2ae572aa3 |
hex | 78fb5ebb0e75 |
133021021441653 has 32 divisors (see below), whose sum is σ = 199502785468800. Its totient is φ = 88679940823440.
The previous prime is 133021021441591. The next prime is 133021021441661. The reversal of 133021021441653 is 356144120120331.
133021021441653 is a `hidden beast` number, since 1 + 3 + 3 + 0 + 21 + 0 + 214 + 416 + 5 + 3 = 666.
It is not a de Polignac number, because 133021021441653 - 238 = 132746143534709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133021021441153) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 423707743 + ... + 424021571.
It is an arithmetic number, because the mean of its divisors is an integer number (6234462045900).
Almost surely, 2133021021441653 is an apocalyptic number.
It is an amenable number.
133021021441653 is a deficient number, since it is larger than the sum of its proper divisors (66481764027147).
133021021441653 is an frugal number, since it uses more digits than its factorization.
133021021441653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 507661 (or 507643 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
Adding to 133021021441653 its reverse (356144120120331), we get a palindrome (489165141561984).
The spelling of 133021021441653 in words is "one hundred thirty-three trillion, twenty-one billion, twenty-one million, four hundred forty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •