Base | Representation |
---|---|
bin | 11110001111101100110110… |
… | …011010011101111011110000 |
3 | 122102222121202120001021222122 |
4 | 132033230312122131323300 |
5 | 114413401131312014212 |
6 | 1150524411454053412 |
7 | 40006255103660114 |
oct | 3617546632357360 |
9 | 572877676037878 |
10 | 133020345032432 |
11 | 3942567aa349a0 |
12 | 12b042984aa268 |
13 | 592b9c30c6b00 |
14 | 24bc30d113744 |
15 | 105a26eeb0272 |
hex | 78fb3669def0 |
133020345032432 has 120 divisors (see below), whose sum is σ = 312676040198160. Its totient is φ = 54304279511040.
The previous prime is 133020345032413. The next prime is 133020345032447. The reversal of 133020345032432 is 234230543020331.
It is a junction number, because it is equal to n+sod(n) for n = 133020345032392 and 133020345032401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 59334257 + ... + 61535312.
It is an arithmetic number, because the mean of its divisors is an integer number (2605633668318).
Almost surely, 2133020345032432 is an apocalyptic number.
It is an amenable number.
133020345032432 is an abundant number, since it is smaller than the sum of its proper divisors (179655695165728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133020345032432 is a wasteful number, since it uses less digits than its factorization.
133020345032432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120869651 (or 120869632 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 35.
Adding to 133020345032432 its reverse (234230543020331), we get a palindrome (367250888052763).
The spelling of 133020345032432 in words is "one hundred thirty-three trillion, twenty billion, three hundred forty-five million, thirty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.078 sec. • engine limits •