Base | Representation |
---|---|
bin | 1110010110000… |
… | …00011000000001 |
3 | 22101102011201221 |
4 | 13023000120001 |
5 | 221300410013 |
6 | 15534555041 |
7 | 2660515411 |
oct | 713003001 |
9 | 271364657 |
10 | 120325633 |
11 | 61a1447a |
12 | 34368a81 |
13 | 1bc0c1cc |
14 | 11da2641 |
15 | a86c08d |
hex | 72c0601 |
120325633 has 2 divisors, whose sum is σ = 120325634. Its totient is φ = 120325632.
The previous prime is 120325631. The next prime is 120325649. The reversal of 120325633 is 336523021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88887184 + 31438449 = 9428^2 + 5607^2 .
It is an emirp because it is prime and its reverse (336523021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120325633 - 21 = 120325631 is a prime.
Together with 120325631, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 120325598 and 120325607.
It is not a weakly prime, because it can be changed into another prime (120325631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60162816 + 60162817.
It is an arithmetic number, because the mean of its divisors is an integer number (60162817).
Almost surely, 2120325633 is an apocalyptic number.
It is an amenable number.
120325633 is a deficient number, since it is larger than the sum of its proper divisors (1).
120325633 is an equidigital number, since it uses as much as digits as its factorization.
120325633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 25.
The square root of 120325633 is about 10969.3041256043. The cubic root of 120325633 is about 493.6881674853.
Adding to 120325633 its reverse (336523021), we get a palindrome (456848654).
The spelling of 120325633 in words is "one hundred twenty million, three hundred twenty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •