Base | Representation |
---|---|
bin | 10101100011111000… |
… | …001010010001101101 |
3 | 2012202101202101220211 |
4 | 111203320022101231 |
5 | 334403012044041 |
6 | 14345111342421 |
7 | 1446456012622 |
oct | 254370122155 |
9 | 65671671824 |
10 | 23150503021 |
11 | 98aa945628 |
12 | 45a1081a11 |
13 | 224c305cc9 |
14 | 11988a8349 |
15 | 90763d481 |
hex | 563e0a46d |
23150503021 has 4 divisors (see below), whose sum is σ = 23153007772. Its totient is φ = 23147998272.
The previous prime is 23150502997. The next prime is 23150503031. The reversal of 23150503021 is 12030505132.
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 12661875625 + 10488627396 = 112525^2 + 102414^2 .
It is a cyclic number.
It is not a de Polignac number, because 23150503021 - 229 = 22613632109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23150502983 and 23150503001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23150503031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1238460 + ... + 1257013.
It is an arithmetic number, because the mean of its divisors is an integer number (5788251943).
Almost surely, 223150503021 is an apocalyptic number.
It is an amenable number.
23150503021 is a deficient number, since it is larger than the sum of its proper divisors (2504751).
23150503021 is an equidigital number, since it uses as much as digits as its factorization.
23150503021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2504750.
The product of its (nonzero) digits is 900, while the sum is 22.
The spelling of 23150503021 in words is "twenty-three billion, one hundred fifty million, five hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •