Base | Representation |
---|---|
bin | 11110000100100001010001… |
… | …110100001110000011110001 |
3 | 122100021011112122220011000111 |
4 | 132010201101310032003301 |
5 | 114313304101414401001 |
6 | 1145135422130021321 |
7 | 36566614662514666 |
oct | 3604412164160361 |
9 | 570234478804014 |
10 | 132252005622001 |
11 | 39159840409801 |
12 | 129bb3a9117841 |
13 | 58a4406570705 |
14 | 249306197da6d |
15 | 10452a14b3851 |
hex | 784851d0e0f1 |
132252005622001 has 8 divisors (see below), whose sum is σ = 132332467368800. Its totient is φ = 132171546961728.
The previous prime is 132252005621867. The next prime is 132252005622031. The reversal of 132252005622001 is 100226500252231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132252005622001 - 219 = 132252005097713 is a prime.
It is a super-2 number, since 2×1322520056220012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132252005622031) 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, 88056985 + ... + 89546281.
It is an arithmetic number, because the mean of its divisors is an integer number (16541558421100).
Almost surely, 2132252005622001 is an apocalyptic number.
It is an amenable number.
132252005622001 is a deficient number, since it is larger than the sum of its proper divisors (80461746799).
132252005622001 is a wasteful number, since it uses less digits than its factorization.
132252005622001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1543263.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 132252005622001 its reverse (100226500252231), we get a palindrome (232478505874232).
The spelling of 132252005622001 in words is "one hundred thirty-two trillion, two hundred fifty-two billion, five million, six hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •