Base | Representation |
---|---|
bin | 1010111000001011000100… |
… | …10111000001101011001101 |
3 | 10010200202112102222000211222 |
4 | 11130011202113001223031 |
5 | 11113402310201343030 |
6 | 122512502243053125 |
7 | 5016120622236245 |
oct | 534054227015315 |
9 | 103622472860758 |
10 | 23920323074765 |
11 | 7692608857467 |
12 | 2823b039711a5 |
13 | 10468a4b94260 |
14 | 5c9a6d6c0b25 |
15 | 2b7350ddd3e5 |
hex | 15c1625c1acd |
23920323074765 has 8 divisors (see below), whose sum is σ = 30912417512088. Its totient is φ = 17664238578240.
The previous prime is 23920323074741. The next prime is 23920323074801. The reversal of 23920323074765 is 56747032302932.
It can be written as a sum of positive squares in 4 ways, for example, as 339616210756 + 23580706864009 = 582766^2 + 4855997^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23920323074765 - 226 = 23920255965901 is a prime.
It is a super-2 number, since 2×239203230747652 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184002485126 + ... + 184002485255.
It is an arithmetic number, because the mean of its divisors is an integer number (3864052189011).
Almost surely, 223920323074765 is an apocalyptic number.
It is an amenable number.
23920323074765 is a deficient number, since it is larger than the sum of its proper divisors (6992094437323).
23920323074765 is a wasteful number, since it uses less digits than its factorization.
23920323074765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368004970399.
The product of its (nonzero) digits is 11430720, while the sum is 53.
The spelling of 23920323074765 in words is "twenty-three trillion, nine hundred twenty billion, three hundred twenty-three million, seventy-four thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •