Base | Representation |
---|---|
bin | 1100000001101011111… |
… | …01101011110111010001 |
3 | 1110111121011111220112101 |
4 | 12000311331223313101 |
5 | 23232234342121223 |
6 | 513455350200401 |
7 | 41566013642014 |
oct | 6006575536721 |
9 | 1414534456471 |
10 | 413222223313 |
11 | 14a279199489 |
12 | 68103353101 |
13 | 2cc74a78713 |
14 | 1600025737b |
15 | ab375e44ad |
hex | 6035f6bdd1 |
413222223313 has 2 divisors, whose sum is σ = 413222223314. Its totient is φ = 413222223312.
The previous prime is 413222223301. The next prime is 413222223341. The reversal of 413222223313 is 313322222314.
It is an a-pointer prime, because the next prime (413222223341) can be obtained adding 413222223313 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 237386251729 + 175835971584 = 487223^2 + 419328^2 .
It is a cyclic number.
It is not a de Polignac number, because 413222223313 - 29 = 413222222801 is a prime.
It is not a weakly prime, because it can be changed into another prime (413222223373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206611111656 + 206611111657.
It is an arithmetic number, because the mean of its divisors is an integer number (206611111657).
Almost surely, 2413222223313 is an apocalyptic number.
It is an amenable number.
413222223313 is a deficient number, since it is larger than the sum of its proper divisors (1).
413222223313 is an equidigital number, since it uses as much as digits as its factorization.
413222223313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 10368, while the sum is 28.
Adding to 413222223313 its reverse (313322222314), we get a palindrome (726544445627).
Subtracting from 413222223313 its reverse (313322222314), we obtain a palindrome (99900000999).
The spelling of 413222223313 in words is "four hundred thirteen billion, two hundred twenty-two million, two hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •