Base | Representation |
---|---|
bin | 101011100010110… |
… | …1101000100001101 |
3 | 10202211100020101001 |
4 | 1113011231010031 |
5 | 10443021104401 |
6 | 400552420301 |
7 | 51131153650 |
oct | 12705550415 |
9 | 3684306331 |
10 | 1461113101 |
11 | 68a83a998 |
12 | 3493a7691 |
13 | 1a3928286 |
14 | dc09d897 |
15 | 88417601 |
hex | 5716d10d |
1461113101 has 4 divisors (see below), whose sum is σ = 1669843552. Its totient is φ = 1252382652.
The previous prime is 1461113081. The next prime is 1461113117. The reversal of 1461113101 is 1013111641.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1013111641 = 373 ⋅2716117.
It is a cyclic number.
It is not a de Polignac number, because 1461113101 - 215 = 1461080333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461117101) 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, 104365215 + ... + 104365228.
It is an arithmetic number, because the mean of its divisors is an integer number (417460888).
Almost surely, 21461113101 is an apocalyptic number.
It is an amenable number.
1461113101 is a deficient number, since it is larger than the sum of its proper divisors (208730451).
1461113101 is an equidigital number, since it uses as much as digits as its factorization.
1461113101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208730450.
The product of its (nonzero) digits is 72, while the sum is 19.
The square root of 1461113101 is about 38224.5091662404. The cubic root of 1461113101 is about 1134.7354208727.
Adding to 1461113101 its reverse (1013111641), we get a palindrome (2474224742).
The spelling of 1461113101 in words is "one billion, four hundred sixty-one million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •