Base | Representation |
---|---|
bin | 11110001111101100110110… |
… | …011010011101111011110001 |
3 | 122102222121202120001021222200 |
4 | 132033230312122131323301 |
5 | 114413401131312014213 |
6 | 1150524411454053413 |
7 | 40006255103660115 |
oct | 3617546632357361 |
9 | 572877676037880 |
10 | 133020345032433 |
11 | 3942567aa349a1 |
12 | 12b042984aa269 |
13 | 592b9c30c6b01 |
14 | 24bc30d113745 |
15 | 105a26eeb0273 |
hex | 78fb3669def1 |
133020345032433 has 24 divisors (see below), whose sum is σ = 194780685528000. Its totient is φ = 87468359085600.
The previous prime is 133020345032413. The next prime is 133020345032447. The reversal of 133020345032433 is 334230543020331.
133020345032433 is a `hidden beast` number, since 1 + 3 + 302 + 0 + 345 + 0 + 3 + 2 + 4 + 3 + 3 = 666.
It is not a de Polignac number, because 133020345032433 - 26 = 133020345032369 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (133020345032413) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 277968183 + ... + 278446316.
It is an arithmetic number, because the mean of its divisors is an integer number (8115861897000).
Almost surely, 2133020345032433 is an apocalyptic number.
It is an amenable number.
133020345032433 is a deficient number, since it is larger than the sum of its proper divisors (61760340495567).
133020345032433 is a wasteful number, since it uses less digits than its factorization.
133020345032433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 556414869 (or 556414866 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 36.
Adding to 133020345032433 its reverse (334230543020331), we get a palindrome (467250888052764).
The spelling of 133020345032433 in words is "one hundred thirty-three trillion, twenty billion, three hundred forty-five million, thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •