Base | Representation |
---|---|
bin | 111110100000011001… |
… | …1100100010100011111 |
3 | 110211110210202211002202 |
4 | 1331000303210110133 |
5 | 4144401144333421 |
6 | 141355345242115 |
7 | 12461242523564 |
oct | 1750063442437 |
9 | 424423684082 |
10 | 134231246111 |
11 | 51a22047a46 |
12 | 2202193333b |
13 | c8726a0761 |
14 | 66d541686b |
15 | 375956610b |
hex | 1f40ce451f |
134231246111 has 8 divisors (see below), whose sum is σ = 139271967120. Its totient is φ = 129217995648.
The previous prime is 134231246081. The next prime is 134231246117. The reversal of 134231246111 is 111642132431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134231246111 - 234 = 117051376927 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134231246117) 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 7 ways as a sum of consecutive naturals, for example, 6857681 + ... + 6877226.
It is an arithmetic number, because the mean of its divisors is an integer number (17408995890).
Almost surely, 2134231246111 is an apocalyptic number.
134231246111 is a deficient number, since it is larger than the sum of its proper divisors (5040721009).
134231246111 is a wasteful number, since it uses less digits than its factorization.
134231246111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13735273.
The product of its digits is 3456, while the sum is 29.
Adding to 134231246111 its reverse (111642132431), we get a palindrome (245873378542).
The spelling of 134231246111 in words is "one hundred thirty-four billion, two hundred thirty-one million, two hundred forty-six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •