Base | Representation |
---|---|
bin | 101001000011110000100… |
… | …0010001101010110110001 |
3 | 201222110202002002111010101 |
4 | 1102013201002031112301 |
5 | 1214424000240342431 |
6 | 20000220041032401 |
7 | 1121461321266265 |
oct | 122074102152661 |
9 | 21873662074111 |
10 | 5643067512241 |
11 | 1886236550485 |
12 | 7717b7a85701 |
13 | 31c1a6465913 |
14 | 1571a97760a5 |
15 | 9bbc8503961 |
hex | 521e108d5b1 |
5643067512241 has 2 divisors, whose sum is σ = 5643067512242. Its totient is φ = 5643067512240.
The previous prime is 5643067512193. The next prime is 5643067512287. The reversal of 5643067512241 is 1422157603465.
It is an a-pointer prime, because the next prime (5643067512287) can be obtained adding 5643067512241 to its sum of digits (46).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5643024005025 + 43507216 = 2375505^2 + 6596^2 .
It is a cyclic number.
It is not a de Polignac number, because 5643067512241 - 27 = 5643067512113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5643067512191 and 5643067512200.
It is not a weakly prime, because it can be changed into another prime (5643061512241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2821533756120 + 2821533756121.
It is an arithmetic number, because the mean of its divisors is an integer number (2821533756121).
Almost surely, 25643067512241 is an apocalyptic number.
It is an amenable number.
5643067512241 is a deficient number, since it is larger than the sum of its proper divisors (1).
5643067512241 is an equidigital number, since it uses as much as digits as its factorization.
5643067512241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1209600, while the sum is 46.
The spelling of 5643067512241 in words is "five trillion, six hundred forty-three billion, sixty-seven million, five hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •