Base | Representation |
---|---|
bin | 1010000111011101100011… |
… | …1100001111111111010110 |
3 | 1110101101012121011211010111 |
4 | 2201313120330033333112 |
5 | 2424221014330032014 |
6 | 35353551132513234 |
7 | 2225426663666611 |
oct | 241673074177726 |
9 | 43341177154114 |
10 | 11123310002134 |
11 | 35a940756a690 |
12 | 12b793201b81a |
13 | 628c012b3265 |
14 | 2a652a33d178 |
15 | 14452203b2c4 |
hex | a1dd8f0ffd6 |
11123310002134 has 8 divisors (see below), whose sum is σ = 18201780003528. Its totient is φ = 5056050000960.
The previous prime is 11123310002093. The next prime is 11123310002137. The reversal of 11123310002134 is 43120001332111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 505605000097 = 11123310002134 / (1 + 1 + 1 + 2 + 3 + 3 + 1 + 0 + 0 + 0 + 2 + 1 + 3 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11123310002137) 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, 252802500027 + ... + 252802500070.
It is an arithmetic number, because the mean of its divisors is an integer number (2275222500441).
Almost surely, 211123310002134 is an apocalyptic number.
11123310002134 is a deficient number, since it is larger than the sum of its proper divisors (7078470001394).
11123310002134 is a wasteful number, since it uses less digits than its factorization.
11123310002134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505605000110.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11123310002134 its reverse (43120001332111), we get a palindrome (54243311334245).
The spelling of 11123310002134 in words is "eleven trillion, one hundred twenty-three billion, three hundred ten million, two thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •