Base | Representation |
---|---|
bin | 1010001101111010110100… |
… | …0100000110011000000101 |
3 | 1110202222112201012121120021 |
4 | 2203132231010012120011 |
5 | 2433030212202341401 |
6 | 35520535012135141 |
7 | 2236435005012004 |
oct | 243365504063005 |
9 | 43688481177507 |
10 | 11234243012101 |
11 | 3641463338a0a |
12 | 13153313074b1 |
13 | 6364ccb93865 |
14 | 2aba513d2c3b |
15 | 147365ed12a1 |
hex | a37ad106605 |
11234243012101 has 6 divisors (see below), whose sum is σ = 11371226095430. Its totient is φ = 11098890679848.
The previous prime is 11234243012051. The next prime is 11234243012123. The reversal of 11234243012101 is 10121034243211.
It can be written as a sum of positive squares in only one way, i.e., 10762172330625 + 472070681476 = 3280575^2 + 687074^2 .
It is not a de Polignac number, because 11234243012101 - 27 = 11234243011973 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 (11234243012191) 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 5 ways as a sum of consecutive naturals, for example, 815368566 + ... + 815382343.
Almost surely, 211234243012101 is an apocalyptic number.
It is an amenable number.
11234243012101 is a deficient number, since it is larger than the sum of its proper divisors (136983083329).
11234243012101 is an frugal number, since it uses more digits than its factorization.
11234243012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1630751075 (or 1630750992 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11234243012101 its reverse (10121034243211), we get a palindrome (21355277255312).
The spelling of 11234243012101 in words is "eleven trillion, two hundred thirty-four billion, two hundred forty-three million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •