Base | Representation |
---|---|
bin | 10011101011101100… |
… | …000001011011011011 |
3 | 2000112212110020102122 |
4 | 103223230001123123 |
5 | 321240304231011 |
6 | 13413040051455 |
7 | 1345502335040 |
oct | 235354013333 |
9 | 60485406378 |
10 | 21134055131 |
11 | 8a65694472 |
12 | 4119903b8b |
13 | 1cba620287 |
14 | 1046b6b1c7 |
15 | 83a5cc3db |
hex | 4ebb016db |
21134055131 has 8 divisors (see below), whose sum is σ = 24154927104. Its totient is φ = 18113613480.
The previous prime is 21134055127. The next prime is 21134055139. The reversal of 21134055131 is 13155043112.
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 21134055131 - 22 = 21134055127 is a prime.
It is a super-2 number, since 2×211340551312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21134055131.
It is not an unprimeable number, because it can be changed into a prime (21134055139) 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, 5606 + ... + 205668.
It is an arithmetic number, because the mean of its divisors is an integer number (3019365888).
Almost surely, 221134055131 is an apocalyptic number.
21134055131 is a deficient number, since it is larger than the sum of its proper divisors (3020871973).
21134055131 is a wasteful number, since it uses less digits than its factorization.
21134055131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215161.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 21134055131 its reverse (13155043112), we get a palindrome (34289098243).
The spelling of 21134055131 in words is "twenty-one billion, one hundred thirty-four million, fifty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •