Base | Representation |
---|---|
bin | 1011000001010… |
… | …0101111110001 |
3 | 10012222100002211 |
4 | 2300110233301 |
5 | 43313103241 |
6 | 4330412121 |
7 | 1100611645 |
oct | 260245761 |
9 | 105870084 |
10 | 46222321 |
11 | 24100572 |
12 | 13591041 |
13 | 9764ab2 |
14 | 61d2c25 |
15 | 40d0781 |
hex | 2c14bf1 |
46222321 has 2 divisors, whose sum is σ = 46222322. Its totient is φ = 46222320.
The previous prime is 46222279. The next prime is 46222331. The reversal of 46222321 is 12322264.
46222321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40462321 + 5760000 = 6361^2 + 2400^2 .
It is a cyclic number.
It is not a de Polignac number, because 46222321 - 223 = 37833713 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 46222292 and 46222301.
It is not a weakly prime, because it can be changed into another prime (46222331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23111160 + 23111161.
It is an arithmetic number, because the mean of its divisors is an integer number (23111161).
Almost surely, 246222321 is an apocalyptic number.
It is an amenable number.
46222321 is a deficient number, since it is larger than the sum of its proper divisors (1).
46222321 is an equidigital number, since it uses as much as digits as its factorization.
46222321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 22.
The square root of 46222321 is about 6798.6999492550. The cubic root of 46222321 is about 358.8810964507.
Adding to 46222321 its reverse (12322264), we get a palindrome (58544585).
The spelling of 46222321 in words is "forty-six million, two hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •