Base | Representation |
---|---|
bin | 110100101100101111101… |
… | …100111100010100000101 |
3 | 110211012121121122111222202 |
4 | 310230233230330110011 |
5 | 433313221140203221 |
6 | 11411401423404245 |
7 | 522433045616666 |
oct | 64545754742405 |
9 | 13735547574882 |
10 | 3621457741061 |
11 | 1176940535776 |
12 | 4a5a42a53685 |
13 | 20366ab7c4c4 |
14 | c73cacc536d |
15 | 643082cad0b |
hex | 34b2fb3c505 |
3621457741061 has 16 divisors (see below), whose sum is σ = 3763843891200. Its totient is φ = 3481878405168.
The previous prime is 3621457740913. The next prime is 3621457741063. The reversal of 3621457741061 is 1601477541263.
It is a cyclic number.
It is not a de Polignac number, because 3621457741061 - 210 = 3621457740037 is a prime.
It is a super-2 number, since 2×36214577410612 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3621457740997 and 3621457741015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3621457741063) 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, 3487100 + ... + 4404858.
It is an arithmetic number, because the mean of its divisors is an integer number (235240243200).
Almost surely, 23621457741061 is an apocalyptic number.
It is an amenable number.
3621457741061 is a deficient number, since it is larger than the sum of its proper divisors (142386150139).
3621457741061 is a wasteful number, since it uses less digits than its factorization.
3621457741061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919288.
The product of its (nonzero) digits is 846720, while the sum is 47.
The spelling of 3621457741061 in words is "three trillion, six hundred twenty-one billion, four hundred fifty-seven million, seven hundred forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •