Base | Representation |
---|---|
bin | 10101100000111000… |
… | …010011101111001101 |
3 | 2012121220010021000222 |
4 | 111200320103233031 |
5 | 334302123211000 |
6 | 14340113401125 |
7 | 1445305355246 |
oct | 254070235715 |
9 | 65556107028 |
10 | 23100210125 |
11 | 9884514853 |
12 | 45882691a5 |
13 | 2241a774b5 |
14 | 1191d35ccd |
15 | 903006a85 |
hex | 560e13bcd |
23100210125 has 16 divisors (see below), whose sum is σ = 28850273712. Its totient is φ = 18466571200.
The previous prime is 23100210121. The next prime is 23100210131. The reversal of 23100210125 is 52101200132.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 6061868164 + 17038341961 = 77858^2 + 130531^2 .
It is not a de Polignac number, because 23100210125 - 22 = 23100210121 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 (23100210121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104327 + ... + 238923.
It is an arithmetic number, because the mean of its divisors is an integer number (1803142107).
Almost surely, 223100210125 is an apocalyptic number.
23100210125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
23100210125 is a deficient number, since it is larger than the sum of its proper divisors (5750063587).
23100210125 is a wasteful number, since it uses less digits than its factorization.
23100210125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135985 (or 135975 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 23100210125 its reverse (52101200132), we get a palindrome (75201410257).
The spelling of 23100210125 in words is "twenty-three billion, one hundred million, two hundred ten thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •