Base | Representation |
---|---|
bin | 111110011010101110… |
… | …0010111011010000101 |
3 | 110210222112001201201221 |
4 | 1330311130113122011 |
5 | 4144003344131113 |
6 | 141324415320341 |
7 | 12453436265440 |
oct | 1746534273205 |
9 | 423875051657 |
10 | 134040614533 |
11 | 51934483691 |
12 | 21b89b200b1 |
13 | c8420466c7 |
14 | 66b7d92657 |
15 | 374795c98d |
hex | 1f35717685 |
134040614533 has 4 divisors (see below), whose sum is σ = 153189273760. Its totient is φ = 114891955308.
The previous prime is 134040614489. The next prime is 134040614549. The reversal of 134040614533 is 335416040431.
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: 335416040431 = 151 ⋅2221298281.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134040614533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134040614563) 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, 9574329603 + ... + 9574329616.
It is an arithmetic number, because the mean of its divisors is an integer number (38297318440).
Almost surely, 2134040614533 is an apocalyptic number.
It is an amenable number.
134040614533 is a deficient number, since it is larger than the sum of its proper divisors (19148659227).
134040614533 is an equidigital number, since it uses as much as digits as its factorization.
134040614533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19148659226.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 134040614533 its reverse (335416040431), we get a palindrome (469456654964).
The spelling of 134040614533 in words is "one hundred thirty-four billion, forty million, six hundred fourteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •