Base | Representation |
---|---|
bin | 111101001100011110… |
… | …0110111101000011111 |
3 | 110120012112201101122122 |
4 | 1322120330313220133 |
5 | 4123114232042343 |
6 | 140212105533155 |
7 | 12331406010653 |
oct | 1723074675037 |
9 | 416175641578 |
10 | 131415112223 |
11 | 5080744a96a |
12 | 215767a41bb |
13 | c514114a45 |
14 | 65093d2a63 |
15 | 36421e1068 |
hex | 1e98f37a1f |
131415112223 has 4 divisors (see below), whose sum is σ = 139145412960. Its totient is φ = 123684811488.
The previous prime is 131415112159. The next prime is 131415112247. The reversal of 131415112223 is 322211514131.
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 131415112223 - 26 = 131415112159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131415112192 and 131415112201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131415112723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3865150343 + ... + 3865150376.
It is an arithmetic number, because the mean of its divisors is an integer number (34786353240).
Almost surely, 2131415112223 is an apocalyptic number.
131415112223 is a deficient number, since it is larger than the sum of its proper divisors (7730300737).
131415112223 is an equidigital number, since it uses as much as digits as its factorization.
131415112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7730300736.
The product of its digits is 1440, while the sum is 26.
Adding to 131415112223 its reverse (322211514131), we get a palindrome (453626626354).
The spelling of 131415112223 in words is "one hundred thirty-one billion, four hundred fifteen million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •