Base | Representation |
---|---|
bin | 1000101100010100100110001… |
… | …0111111001001010111110000 |
3 | 2222012210020222002222201222120 |
4 | 2023011021202333021113300 |
5 | 1120133300334122113402 |
6 | 10004534550401234240 |
7 | 242561405641112451 |
oct | 21305114277112760 |
9 | 2865706862881876 |
10 | 611682313082352 |
11 | 1679a0015234536 |
12 | 58730169032980 |
13 | 20340518c98965 |
14 | ab09820ad9128 |
15 | 4aab3d9cbb3bc |
hex | 22c5262fc95f0 |
611682313082352 has 80 divisors (see below), whose sum is σ = 1673141154969600. Its totient is φ = 191899172555776.
The previous prime is 611682313082333. The next prime is 611682313082353. The reversal of 611682313082352 is 253280313286116.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 611682313082295 and 611682313082304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (611682313082353) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138009649 + ... + 142372847.
It is an arithmetic number, because the mean of its divisors is an integer number (20914264437120).
Almost surely, 2611682313082352 is an apocalyptic number.
It is an amenable number.
611682313082352 is an abundant number, since it is smaller than the sum of its proper divisors (1061458841887248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
611682313082352 is a wasteful number, since it uses less digits than its factorization.
611682313082352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4535030 (or 4535024 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 51.
The spelling of 611682313082352 in words is "six hundred eleven trillion, six hundred eighty-two billion, three hundred thirteen million, eighty-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •