Base | Representation |
---|---|
bin | 11011011110101… |
… | …111101010110001 |
3 | 1012010112111000120 |
4 | 123132233222301 |
5 | 1421011410101 |
6 | 113425440453 |
7 | 14265545526 |
oct | 3336575261 |
9 | 1163474016 |
10 | 461044401 |
11 | 21727a534 |
12 | 10a4a0129 |
13 | 74695a4c |
14 | 4533514d |
15 | 2a720b36 |
hex | 1b7afab1 |
461044401 has 4 divisors (see below), whose sum is σ = 614725872. Its totient is φ = 307362932.
The previous prime is 461044391. The next prime is 461044439. The reversal of 461044401 is 104440164.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 461044401 - 223 = 452655793 is a prime.
It is not an unprimeable number, because it can be changed into a prime (461045401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76840731 + ... + 76840736.
It is an arithmetic number, because the mean of its divisors is an integer number (153681468).
Almost surely, 2461044401 is an apocalyptic number.
It is an amenable number.
461044401 is a deficient number, since it is larger than the sum of its proper divisors (153681471).
461044401 is a wasteful number, since it uses less digits than its factorization.
461044401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153681470.
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 461044401 is about 21471.9445090565. The cubic root of 461044401 is about 772.5280382781.
Adding to 461044401 its reverse (104440164), we get a palindrome (565484565).
It can be divided in two parts, 46104 and 4401, that added together give a palindrome (50505).
The spelling of 461044401 in words is "four hundred sixty-one million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •