Base | Representation |
---|---|
bin | 10000000000011… |
… | …00101110011101 |
3 | 100100122121121112 |
4 | 20000030232131 |
5 | 233333113403 |
6 | 21153511405 |
7 | 3220163204 |
oct | 1000145635 |
9 | 310577545 |
10 | 134269853 |
11 | 69878a23 |
12 | 38b72565 |
13 | 21a82123 |
14 | 13b9223b |
15 | bbc39d8 |
hex | 800cb9d |
134269853 has 4 divisors (see below), whose sum is σ = 134296800. Its totient is φ = 134242908.
The previous prime is 134269843. The next prime is 134269871. The reversal of 134269853 is 358962431.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134269853 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 134269853.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134269823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3575 + ... + 16772.
It is an arithmetic number, because the mean of its divisors is an integer number (33574200).
Almost surely, 2134269853 is an apocalyptic number.
It is an amenable number.
134269853 is a deficient number, since it is larger than the sum of its proper divisors (26947).
134269853 is an equidigital number, since it uses as much as digits as its factorization.
134269853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26946.
The product of its digits is 155520, while the sum is 41.
The square root of 134269853 is about 11587.4869147715. The cubic root of 134269853 is about 512.0662717866.
The spelling of 134269853 in words is "one hundred thirty-four million, two hundred sixty-nine thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •