Base | Representation |
---|---|
bin | 111110100000011000… |
… | …0001010100011001001 |
3 | 110211110202002111112002 |
4 | 1331000300022203021 |
5 | 4144400432312441 |
6 | 141355314200345 |
7 | 12461232120203 |
oct | 1750060124311 |
9 | 424422074462 |
10 | 134230354121 |
11 | 51a21598866 |
12 | 220215830b5 |
13 | c87244a756 |
14 | 66d5263773 |
15 | 375943bb9b |
hex | 1f40c0a8c9 |
134230354121 has 4 divisors (see below), whose sum is σ = 134231181252. Its totient is φ = 134229526992.
The previous prime is 134230354109. The next prime is 134230354127. The reversal of 134230354121 is 121453032431.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 31869390400 + 102360963721 = 178520^2 + 319939^2 .
It is a cyclic number.
It is not a de Polignac number, because 134230354121 - 222 = 134226159817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134230354127) 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, 80990 + ... + 524423.
It is an arithmetic number, because the mean of its divisors is an integer number (33557795313).
Almost surely, 2134230354121 is an apocalyptic number.
It is an amenable number.
134230354121 is a deficient number, since it is larger than the sum of its proper divisors (827131).
134230354121 is an equidigital number, since it uses as much as digits as its factorization.
134230354121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 827130.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 134230354121 its reverse (121453032431), we get a palindrome (255683386552).
The spelling of 134230354121 in words is "one hundred thirty-four billion, two hundred thirty million, three hundred fifty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •