Base | Representation |
---|---|
bin | 1010001100010101101110… |
… | …10010011011000011000001 |
3 | 2221100210000010210121000022 |
4 | 11012022313102123003001 |
5 | 10414213302342113213 |
6 | 115400540431303225 |
7 | 4502242061642546 |
oct | 506126722330301 |
9 | 87323003717008 |
10 | 22414214410433 |
11 | 71618a677415a |
12 | 262003707ab15 |
13 | c67861026791 |
14 | 576bd4a3abcd |
15 | 28d0a25e4308 |
hex | 1462b749b0c1 |
22414214410433 has 2 divisors, whose sum is σ = 22414214410434. Its totient is φ = 22414214410432.
The previous prime is 22414214410417. The next prime is 22414214410451. The reversal of 22414214410433 is 33401441241422.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21870054430849 + 544159979584 = 4676543^2 + 737672^2 .
It is a cyclic number.
It is not a de Polignac number, because 22414214410433 - 24 = 22414214410417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22414214410393 and 22414214410402.
It is not a weakly prime, because it can be changed into another prime (22414214412433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11207107205216 + 11207107205217.
It is an arithmetic number, because the mean of its divisors is an integer number (11207107205217).
Almost surely, 222414214410433 is an apocalyptic number.
It is an amenable number.
22414214410433 is a deficient number, since it is larger than the sum of its proper divisors (1).
22414214410433 is an equidigital number, since it uses as much as digits as its factorization.
22414214410433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 22414214410433 its reverse (33401441241422), we get a palindrome (55815655651855).
The spelling of 22414214410433 in words is "twenty-two trillion, four hundred fourteen billion, two hundred fourteen million, four hundred ten thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •