Base | Representation |
---|---|
bin | 11100101010101… |
… | …010011101010001 |
3 | 1020111222120212212 |
4 | 130222222131101 |
5 | 1441110233001 |
6 | 115420201505 |
7 | 14626654634 |
oct | 3452523521 |
9 | 1214876785 |
10 | 480946001 |
11 | 227532938 |
12 | 115099295 |
13 | 78843443 |
14 | 47c35c1b |
15 | 2c3527bb |
hex | 1caaa751 |
480946001 has 2 divisors, whose sum is σ = 480946002. Its totient is φ = 480946000.
The previous prime is 480945991. The next prime is 480946003. The reversal of 480946001 is 100649084.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 473106001 + 7840000 = 21751^2 + 2800^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-480946001 is a prime.
It is a super-3 number, since 3×4809460013 (a number of 27 digits) contains 333 as substring.
It is a Sophie Germain prime.
Together with 480946003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is equal to p25403738 and since 480946001 and 25403738 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (480946003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 240473000 + 240473001.
It is an arithmetic number, because the mean of its divisors is an integer number (240473001).
Almost surely, 2480946001 is an apocalyptic number.
It is an amenable number.
480946001 is a deficient number, since it is larger than the sum of its proper divisors (1).
480946001 is an equidigital number, since it uses as much as digits as its factorization.
480946001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 32.
The square root of 480946001 is about 21930.4810936742. The cubic root of 480946001 is about 783.4875613432.
The spelling of 480946001 in words is "four hundred eighty million, nine hundred forty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •