Base | Representation |
---|---|
bin | 111110100011000011… |
… | …1010010010010100111 |
3 | 110211201000100021202020 |
4 | 1331012013102102213 |
5 | 4200041444114343 |
6 | 141412250114223 |
7 | 12463403502513 |
oct | 1750607222247 |
9 | 424630307666 |
10 | 134320301223 |
11 | 51a68343409 |
12 | 2204771b973 |
13 | c887c815a4 |
14 | 6703199143 |
15 | 37622a7b83 |
hex | 1f461d24a7 |
134320301223 has 4 divisors (see below), whose sum is σ = 179093734968. Its totient is φ = 89546867480.
The previous prime is 134320301221. The next prime is 134320301249. The reversal of 134320301223 is 322103023431.
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 134320301223 - 21 = 134320301221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134320301193 and 134320301202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134320301221) 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, 22386716868 + ... + 22386716873.
It is an arithmetic number, because the mean of its divisors is an integer number (44773433742).
Almost surely, 2134320301223 is an apocalyptic number.
134320301223 is a deficient number, since it is larger than the sum of its proper divisors (44773433745).
134320301223 is an equidigital number, since it uses as much as digits as its factorization.
134320301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44773433744.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 134320301223 its reverse (322103023431), we get a palindrome (456423324654).
The spelling of 134320301223 in words is "one hundred thirty-four billion, three hundred twenty million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •