Base | Representation |
---|---|
bin | 10010110101101110… |
… | …11111100010010001 |
3 | 222002220002100010001 |
4 | 21122313133202101 |
5 | 131203243243441 |
6 | 4351351210001 |
7 | 505434150244 |
oct | 113267374221 |
9 | 28086070101 |
10 | 10114431121 |
11 | 4320372893 |
12 | 1b63376901 |
13 | c526146b2 |
14 | 6bd42d25b |
15 | 3e2e63731 |
hex | 25addf891 |
10114431121 has 4 divisors (see below), whose sum is σ = 10128499200. Its totient is φ = 10100363044.
The previous prime is 10114431109. The next prime is 10114431143. The reversal of 10114431121 is 12113441101.
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: 12113441101 = 74411 ⋅162791.
It is a cyclic number.
It is not a de Polignac number, because 10114431121 - 29 = 10114430609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10114431521) 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, 7032961 + ... + 7034398.
It is an arithmetic number, because the mean of its divisors is an integer number (2532124800).
Almost surely, 210114431121 is an apocalyptic number.
It is an amenable number.
10114431121 is a deficient number, since it is larger than the sum of its proper divisors (14068079).
10114431121 is an equidigital number, since it uses as much as digits as its factorization.
10114431121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14068078.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10114431121 its reverse (12113441101), we get a palindrome (22227872222).
The spelling of 10114431121 in words is "ten billion, one hundred fourteen million, four hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •