Base | Representation |
---|---|
bin | 11011110010001… |
… | …101101101101001 |
3 | 1012111010210010012 |
4 | 123302031231221 |
5 | 1423313220301 |
6 | 114131101305 |
7 | 14360123441 |
oct | 3362155551 |
9 | 1174123105 |
10 | 466148201 |
11 | 21a146052 |
12 | 110141835 |
13 | 75761b4c |
14 | 45ca3121 |
15 | 2adccebb |
hex | 1bc8db69 |
466148201 has 8 divisors (see below), whose sum is σ = 471088200. Its totient is φ = 461220480.
The previous prime is 466148141. The next prime is 466148219. The reversal of 466148201 is 102841664.
It can be written as a sum of positive squares in 4 ways, for example, as 193237801 + 272910400 = 13901^2 + 16520^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-466148201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (466148231) 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 in 7 ways as a sum of consecutive naturals, for example, 86885 + ... + 92093.
It is an arithmetic number, because the mean of its divisors is an integer number (58886025).
Almost surely, 2466148201 is an apocalyptic number.
It is an amenable number.
466148201 is a deficient number, since it is larger than the sum of its proper divisors (4939999).
466148201 is a wasteful number, since it uses less digits than its factorization.
466148201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6139.
The product of its (nonzero) digits is 9216, while the sum is 32.
The square root of 466148201 is about 21590.4655114242. The cubic root of 466148201 is about 775.3682334733.
Adding to 466148201 its reverse (102841664), we get a palindrome (568989865).
The spelling of 466148201 in words is "four hundred sixty-six million, one hundred forty-eight thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •