Base | Representation |
---|---|
bin | 11110010011000011010010… |
… | …101100011010010000100000 |
3 | 122110210122002102212012021122 |
4 | 132103003102230122100200 |
5 | 114431134212130421402 |
6 | 1151222251454311412 |
7 | 40032016044010526 |
oct | 3623032254322040 |
9 | 573718072765248 |
10 | 133250600248352 |
11 | 39504298005674 |
12 | 12b40a384b8568 |
13 | 59476296288c2 |
14 | 24c95134b6316 |
15 | 1061249672ca2 |
hex | 7930d2b1a420 |
133250600248352 has 24 divisors (see below), whose sum is σ = 273743080946496. Its totient is φ = 63728547944512.
The previous prime is 133250600248279. The next prime is 133250600248357. The reversal of 133250600248352 is 253842006052331.
It is a super-2 number, since 2×1332506002483522 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133250600248357) 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 3 ways as a sum of consecutive naturals, for example, 90523504868 + ... + 90523506339.
It is an arithmetic number, because the mean of its divisors is an integer number (11405961706104).
Almost surely, 2133250600248352 is an apocalyptic number.
It is an amenable number.
133250600248352 is an abundant number, since it is smaller than the sum of its proper divisors (140492480698144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133250600248352 is a wasteful number, since it uses less digits than its factorization.
133250600248352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181047011240 (or 181047011232 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 44.
The spelling of 133250600248352 in words is "one hundred thirty-three trillion, two hundred fifty billion, six hundred million, two hundred forty-eight thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •