Base | Representation |
---|---|
bin | 10101100001000011… |
… | …011100110111011101 |
3 | 2012122002121122212021 |
4 | 111201003130313131 |
5 | 334303400143401 |
6 | 14340300140141 |
7 | 1445342242231 |
oct | 254103346735 |
9 | 65562548767 |
10 | 23103131101 |
11 | 988612a386 |
12 | 4589237651 |
13 | 224255ab9b |
14 | 11924965c1 |
15 | 9033d22a1 |
hex | 5610dcddd |
23103131101 has 4 divisors (see below), whose sum is σ = 23112836604. Its totient is φ = 23093425600.
The previous prime is 23103131081. The next prime is 23103131119. The reversal of 23103131101 is 10113130132.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3432788100 + 19670343001 = 58590^2 + 140251^2 .
It is a cyclic number.
It is not a de Polignac number, because 23103131101 - 217 = 23103000029 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 (23103131131) 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 3 ways as a sum of consecutive naturals, for example, 4849180 + ... + 4853941.
It is an arithmetic number, because the mean of its divisors is an integer number (5778209151).
Almost surely, 223103131101 is an apocalyptic number.
It is an amenable number.
23103131101 is a deficient number, since it is larger than the sum of its proper divisors (9705503).
23103131101 is an equidigital number, since it uses as much as digits as its factorization.
23103131101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9705502.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 23103131101 its reverse (10113130132), we get a palindrome (33216261233).
The spelling of 23103131101 in words is "twenty-three billion, one hundred three million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •