Base | Representation |
---|---|
bin | 110100101011111010011… |
… | …100001000001001100001 |
3 | 110211010022100011220122220 |
4 | 310223322130020021201 |
5 | 433304403410000031 |
6 | 11411133022421253 |
7 | 522401645263650 |
oct | 64537234101141 |
9 | 13733270156586 |
10 | 3620564140641 |
11 | 1176522084528 |
12 | 4a5833731829 |
13 | 2035579b6966 |
14 | c7344353197 |
15 | 642a4b15596 |
hex | 34afa708261 |
3620564140641 has 32 divisors (see below), whose sum is σ = 5528072847360. Its totient is φ = 2064762838656.
The previous prime is 3620564140637. The next prime is 3620564140643. The reversal of 3620564140641 is 1460414650263.
3620564140641 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3620564140641 - 22 = 3620564140637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3620564140593 and 3620564140602.
It is not an unprimeable number, because it can be changed into a prime (3620564140643) 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 31 ways as a sum of consecutive naturals, for example, 34876485 + ... + 34980141.
It is an arithmetic number, because the mean of its divisors is an integer number (172752276480).
Almost surely, 23620564140641 is an apocalyptic number.
It is an amenable number.
3620564140641 is a deficient number, since it is larger than the sum of its proper divisors (1907508706719).
3620564140641 is a wasteful number, since it uses less digits than its factorization.
3620564140641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106973.
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 3620564140641 in words is "three trillion, six hundred twenty billion, five hundred sixty-four million, one hundred forty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •