Base | Representation |
---|---|
bin | 100110100100111101… |
… | …001101100100001001 |
3 | 10221220210012120022011 |
4 | 212210331031210021 |
5 | 1134313041343213 |
6 | 31010141455521 |
7 | 2664324010324 |
oct | 464475154411 |
9 | 127823176264 |
10 | 41422215433 |
11 | 166268405a5 |
12 | 80402715a1 |
13 | 3ba190b961 |
14 | 200d4237bb |
15 | 11267b903d |
hex | 9a4f4d909 |
41422215433 has 2 divisors, whose sum is σ = 41422215434. Its totient is φ = 41422215432.
The previous prime is 41422215431. The next prime is 41422215437. The reversal of 41422215433 is 33451222414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24622944889 + 16799270544 = 156917^2 + 129612^2 .
It is a cyclic number.
It is not a de Polignac number, because 41422215433 - 21 = 41422215431 is a prime.
Together with 41422215431, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 41422215395 and 41422215404.
It is not a weakly prime, because it can be changed into another prime (41422215431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20711107716 + 20711107717.
It is an arithmetic number, because the mean of its divisors is an integer number (20711107717).
Almost surely, 241422215433 is an apocalyptic number.
It is an amenable number.
41422215433 is a deficient number, since it is larger than the sum of its proper divisors (1).
41422215433 is an equidigital number, since it uses as much as digits as its factorization.
41422215433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23040, while the sum is 31.
Adding to 41422215433 its reverse (33451222414), we get a palindrome (74873437847).
The spelling of 41422215433 in words is "forty-one billion, four hundred twenty-two million, two hundred fifteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •