Base | Representation |
---|---|
bin | 10011101001101100100100… |
… | …11001000111011000101001 |
3 | 12200000020012110120001011012 |
4 | 21310312102121013120221 |
5 | 21131010010214204231 |
6 | 231524143225513305 |
7 | 12050055141336656 |
oct | 1164662231073051 |
9 | 180006173501135 |
10 | 43214122022441 |
11 | 12851008323477 |
12 | 4a1b22a042835 |
13 | 1b160c70aa016 |
14 | a95808c50c2d |
15 | 4ee1725bce2b |
hex | 274d92647629 |
43214122022441 has 2 divisors, whose sum is σ = 43214122022442. Its totient is φ = 43214122022440.
The previous prime is 43214122022429. The next prime is 43214122022507. The reversal of 43214122022441 is 14422022141234.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25038224600041 + 18175897422400 = 5003821^2 + 4263320^2 .
It is a cyclic number.
It is not a de Polignac number, because 43214122022441 - 26 = 43214122022377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 43214122022398 and 43214122022407.
It is not a weakly prime, because it can be changed into another prime (43214124022441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21607061011220 + 21607061011221.
It is an arithmetic number, because the mean of its divisors is an integer number (21607061011221).
Almost surely, 243214122022441 is an apocalyptic number.
It is an amenable number.
43214122022441 is a deficient number, since it is larger than the sum of its proper divisors (1).
43214122022441 is an equidigital number, since it uses as much as digits as its factorization.
43214122022441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 43214122022441 its reverse (14422022141234), we get a palindrome (57636144163675).
The spelling of 43214122022441 in words is "forty-three trillion, two hundred fourteen billion, one hundred twenty-two million, twenty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •