Base | Representation |
---|---|
bin | 111110100010110111… |
… | …1101111111100010111 |
3 | 110211200120201211002201 |
4 | 1331011233233330113 |
5 | 4200033404144343 |
6 | 141411505545331 |
7 | 12463300164256 |
oct | 1750557577427 |
9 | 424616654081 |
10 | 134314131223 |
11 | 51a64909838 |
12 | 22045645247 |
13 | c8869010bc |
14 | 670243079d |
15 | 376198994d |
hex | 1f45beff17 |
134314131223 has 4 divisors (see below), whose sum is σ = 136848360168. Its totient is φ = 131779902280.
The previous prime is 134314131191. The next prime is 134314131247. The reversal of 134314131223 is 322131413431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322131413431 = 71 ⋅4537062161.
It is a cyclic number.
It is not a de Polignac number, because 134314131223 - 25 = 134314131191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134314131191 and 134314131200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134314171223) 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, 1267114393 + ... + 1267114498.
It is an arithmetic number, because the mean of its divisors is an integer number (34212090042).
Almost surely, 2134314131223 is an apocalyptic number.
134314131223 is a deficient number, since it is larger than the sum of its proper divisors (2534228945).
134314131223 is an equidigital number, since it uses as much as digits as its factorization.
134314131223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2534228944.
The product of its digits is 5184, while the sum is 28.
Adding to 134314131223 its reverse (322131413431), we get a palindrome (456445544654).
The spelling of 134314131223 in words is "one hundred thirty-four billion, three hundred fourteen million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •