Base | Representation |
---|---|
bin | 1110100101001101111011… |
… | …01100001111000001110000 |
3 | 11012112101122212210201200221 |
4 | 13102212331230033001300 |
5 | 13200323323004314402 |
6 | 152110302033222424 |
7 | 6516425254311511 |
oct | 722467554170160 |
9 | 135471585721627 |
10 | 32065113354352 |
11 | a242813609791 |
12 | 371a525701a14 |
13 | 14b795b8ca460 |
14 | 7cbd6185aa08 |
15 | 3a91493a2337 |
hex | 1d29bdb0f070 |
32065113354352 has 80 divisors (see below), whose sum is σ = 68580690054912. Its totient is φ = 14429104957440.
The previous prime is 32065113354271. The next prime is 32065113354397. The reversal of 32065113354352 is 25345331156023.
It is a junction number, because it is equal to n+sod(n) for n = 32065113354299 and 32065113354308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12163638 + ... + 14563114.
Almost surely, 232065113354352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32065113354352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34290345027456).
32065113354352 is an abundant number, since it is smaller than the sum of its proper divisors (36515576700560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32065113354352 is a wasteful number, since it uses less digits than its factorization.
32065113354352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2401106 (or 2401100 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 43.
The spelling of 32065113354352 in words is "thirty-two trillion, sixty-five billion, one hundred thirteen million, three hundred fifty-four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •