Base | Representation |
---|---|
bin | 101011100011000… |
… | …1100010110001111 |
3 | 10202211120202010121 |
4 | 1113012030112033 |
5 | 10443034204411 |
6 | 400555245411 |
7 | 51132226342 |
oct | 12706142617 |
9 | 3684522117 |
10 | 1461241231 |
11 | 68a91818a |
12 | 349449867 |
13 | 1a39716a8 |
14 | dc0d4459 |
15 | 88440571 |
hex | 5718c58f |
1461241231 has 4 divisors (see below), whose sum is σ = 1461505464. Its totient is φ = 1460977000.
The previous prime is 1461241181. The next prime is 1461241297. The reversal of 1461241231 is 1321421641.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1461241231 - 217 = 1461110159 is a prime.
It is a super-2 number, since 2×14612412312 = 4270451870348790722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1461241196 and 1461241205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461242231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 123640 + ... + 134941.
It is an arithmetic number, because the mean of its divisors is an integer number (365376366).
Almost surely, 21461241231 is an apocalyptic number.
1461241231 is a deficient number, since it is larger than the sum of its proper divisors (264233).
1461241231 is an equidigital number, since it uses as much as digits as its factorization.
1461241231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264232.
The product of its digits is 1152, while the sum is 25.
The square root of 1461241231 is about 38226.1851484032. The cubic root of 1461241231 is about 1134.7685895119.
Adding to 1461241231 its reverse (1321421641), we get a palindrome (2782662872).
The spelling of 1461241231 in words is "one billion, four hundred sixty-one million, two hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •