Base | Representation |
---|---|
bin | 11110010011000100101001… |
… | …010110000111010001110000 |
3 | 122110210202211202101111202122 |
4 | 132103010221112013101300 |
5 | 114431200201312134412 |
6 | 1151223052025533412 |
7 | 40032100055613446 |
oct | 3623045126072160 |
9 | 573722752344678 |
10 | 133252054021232 |
11 | 39504973691763 |
12 | 12b41183344268 |
13 | 59477cb883b43 |
14 | 24c96105c4b96 |
15 | 10612d20da572 |
hex | 793129587470 |
133252054021232 has 40 divisors (see below), whose sum is σ = 273364258143600. Its totient is φ = 62706484564992.
The previous prime is 133252054021231. The next prime is 133252054021241. The reversal of 133252054021232 is 232120450252331.
It is a super-2 number, since 2×1332520540212322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133252054021192 and 133252054021201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133252054021231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48710894 + ... + 51373682.
It is an arithmetic number, because the mean of its divisors is an integer number (6834106453590).
Almost surely, 2133252054021232 is an apocalyptic number.
It is an amenable number.
133252054021232 is an abundant number, since it is smaller than the sum of its proper divisors (140112204122368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133252054021232 is a wasteful number, since it uses less digits than its factorization.
133252054021232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2846793 (or 2846787 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 35.
The spelling of 133252054021232 in words is "one hundred thirty-three trillion, two hundred fifty-two billion, fifty-four million, twenty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •