Base | Representation |
---|---|
bin | 11110001111101101011111… |
… | …010111100010100111110110 |
3 | 122102222200112102221112010001 |
4 | 132033231133113202213312 |
5 | 114413404033211143222 |
6 | 1150525004001021514 |
7 | 40006311116136115 |
oct | 3617553727424766 |
9 | 572880472845101 |
10 | 133021032131062 |
11 | 394259a28722a9 |
12 | 12b0444a62489a |
13 | 592baa2569b4a |
14 | 24bc37648dc7c |
15 | 105a2b0484e27 |
hex | 78fb5f5e29f6 |
133021032131062 has 8 divisors (see below), whose sum is σ = 199589400207000. Its totient is φ = 66491232062064.
The previous prime is 133021032131041. The next prime is 133021032131069. The reversal of 133021032131062 is 260131230120331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 133021032131062.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133021032131069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9641993112 + ... + 9642006907.
It is an arithmetic number, because the mean of its divisors is an integer number (24948675025875).
Almost surely, 2133021032131062 is an apocalyptic number.
133021032131062 is a deficient number, since it is larger than the sum of its proper divisors (66568368075938).
133021032131062 is a wasteful number, since it uses less digits than its factorization.
133021032131062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19284003470.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 133021032131062 its reverse (260131230120331), we get a palindrome (393152262251393).
The spelling of 133021032131062 in words is "one hundred thirty-three trillion, twenty-one billion, thirty-two million, one hundred thirty-one thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •