Base | Representation |
---|---|
bin | 11110010000010100001000… |
… | …010011001001011110010010 |
3 | 122110010122121212122012100120 |
4 | 132100110020103021132102 |
5 | 114420044020341102032 |
6 | 1151000024524131110 |
7 | 40012310213040513 |
oct | 3620241023113622 |
9 | 573118555565316 |
10 | 133062521034642 |
11 | 39441553211671 |
12 | 12b104a9096a96 |
13 | 5932984c27a34 |
14 | 24c03906b2a0a |
15 | 105b3dca2362c |
hex | 7905084c9792 |
133062521034642 has 32 divisors (see below), whose sum is σ = 276095144635200. Its totient is φ = 42701305217088.
The previous prime is 133062521034581. The next prime is 133062521034643. The reversal of 133062521034642 is 246430125260331.
It is a junction number, because it is equal to n+sod(n) for n = 133062521034594 and 133062521034603.
It is not an unprimeable number, because it can be changed into a prime (133062521034643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1101851917 + ... + 1101972672.
It is an arithmetic number, because the mean of its divisors is an integer number (8627973269850).
Almost surely, 2133062521034642 is an apocalyptic number.
133062521034642 is an abundant number, since it is smaller than the sum of its proper divisors (143032623600558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133062521034642 is a wasteful number, since it uses less digits than its factorization.
133062521034642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2203824970.
The product of its (nonzero) digits is 622080, while the sum is 42.
Adding to 133062521034642 its reverse (246430125260331), we get a palindrome (379492646294973).
The spelling of 133062521034642 in words is "one hundred thirty-three trillion, sixty-two billion, five hundred twenty-one million, thirty-four thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •