Base | Representation |
---|---|
bin | 101011100010101… |
… | …1001000010000001 |
3 | 10202211012001210210 |
4 | 1113011121002001 |
5 | 10443010443131 |
6 | 400550544333 |
7 | 51130362501 |
oct | 12705310201 |
9 | 3684161723 |
10 | 1461031041 |
11 | 68a794278 |
12 | 3493680a9 |
13 | 1a38c9b12 |
14 | dc07ba01 |
15 | 883ed146 |
hex | 57159081 |
1461031041 has 8 divisors (see below), whose sum is σ = 1948993920. Its totient is φ = 973544432.
The previous prime is 1461030959. The next prime is 1461031043. The reversal of 1461031041 is 1401301641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1461031041 - 211 = 1461028993 is a prime.
It is a super-2 number, since 2×14610310412 = 4269223405531087362, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1461030999 and 1461031017.
It is not an unprimeable number, because it can be changed into a prime (1461031043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111846 + ... + 124223.
It is an arithmetic number, because the mean of its divisors is an integer number (243624240).
Almost surely, 21461031041 is an apocalyptic number.
It is an amenable number.
1461031041 is a deficient number, since it is larger than the sum of its proper divisors (487962879).
1461031041 is a wasteful number, since it uses less digits than its factorization.
1461031041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238135.
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 1461031041 is about 38223.4357560908. The cubic root of 1461031041 is about 1134.7141772214.
Adding to 1461031041 its reverse (1401301641), we get a palindrome (2862332682).
The spelling of 1461031041 in words is "one billion, four hundred sixty-one million, thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •