Base | Representation |
---|---|
bin | 101111000001110111001101… |
… | …0011100101011111110001001 |
3 | 2000020200200200110121221022112 |
4 | 1132003232122130223332021 |
5 | 413210102001234410031 |
6 | 4023450243411232105 |
7 | 153063561605114213 |
oct | 13603563234537611 |
9 | 2006620613557275 |
10 | 413672366325641 |
11 | 10a899513413485 |
12 | 3a4905865a8635 |
13 | 149a91a16063a7 |
14 | 7421bc69015b3 |
15 | 32c587a86762b |
hex | 1783b9a72bf89 |
413672366325641 has 8 divisors (see below), whose sum is σ = 414829565136000. Its totient is φ = 412515194783200.
The previous prime is 413672366325553. The next prime is 413672366325649. The reversal of 413672366325641 is 146523663276314.
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 413672366325641 - 246 = 343303622147977 is a prime.
It is a super-2 number, since 2×4136723663256412 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (413672366325649) 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, 23758316 + ... + 37306866.
It is an arithmetic number, because the mean of its divisors is an integer number (51853695642000).
Almost surely, 2413672366325641 is an apocalyptic number.
It is an amenable number.
413672366325641 is a deficient number, since it is larger than the sum of its proper divisors (1157198810359).
413672366325641 is a wasteful number, since it uses less digits than its factorization.
413672366325641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13633959.
The product of its digits is 78382080, while the sum is 59.
The spelling of 413672366325641 in words is "four hundred thirteen trillion, six hundred seventy-two billion, three hundred sixty-six million, three hundred twenty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •