Base | Representation |
---|---|
bin | 101001000100000001101… |
… | …1011111001000111000001 |
3 | 201222112020022010011021112 |
4 | 1102020003123321013001 |
5 | 1214431141013423101 |
6 | 20000353215333105 |
7 | 1121511530122163 |
oct | 122100333710701 |
9 | 21875208104245 |
10 | 5643644670401 |
11 | 18865023179a1 |
12 | 771939221195 |
13 | 31c268bc471a |
14 | 157222294933 |
15 | 9bc0e00d6bb |
hex | 522036f91c1 |
5643644670401 has 2 divisors, whose sum is σ = 5643644670402. Its totient is φ = 5643644670400.
The previous prime is 5643644670383. The next prime is 5643644670449. The reversal of 5643644670401 is 1040764463465.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5613340824001 + 30303846400 = 2369249^2 + 174080^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5643644670401 is a prime.
It is a super-2 number, since 2×56436446704012 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5643644670401.
It is not a weakly prime, because it can be changed into another prime (5643644670701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2821822335200 + 2821822335201.
It is an arithmetic number, because the mean of its divisors is an integer number (2821822335201).
Almost surely, 25643644670401 is an apocalyptic number.
It is an amenable number.
5643644670401 is a deficient number, since it is larger than the sum of its proper divisors (1).
5643644670401 is an equidigital number, since it uses as much as digits as its factorization.
5643644670401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5806080, while the sum is 50.
The spelling of 5643644670401 in words is "five trillion, six hundred forty-three billion, six hundred forty-four million, six hundred seventy thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •