Base | Representation |
---|---|
bin | 1010110000001100100110… |
… | …01111110000010000011100 |
3 | 10002201120010212222212202022 |
4 | 11120012103033300100130 |
5 | 11044410022412020202 |
6 | 122142535550515312 |
7 | 4660246333045640 |
oct | 530062317602034 |
9 | 102646125885668 |
10 | 23646265345052 |
11 | 759736336a869 |
12 | 279a97a505b38 |
13 | 1026aaa87554c |
14 | 5ba6b1b26c20 |
15 | 2b0160eccea2 |
hex | 1581933f041c |
23646265345052 has 12 divisors (see below), whose sum is σ = 47292530690160. Its totient is φ = 10134113719296.
The previous prime is 23646265344973. The next prime is 23646265345063. The reversal of 23646265345052 is 25054356264632.
23646265345052 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 23646265344985 and 23646265345003.
It is a congruent number.
It is an unprimeable number.
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, 422254738277 + ... + 422254738332.
It is an arithmetic number, because the mean of its divisors is an integer number (3941044224180).
Almost surely, 223646265345052 is an apocalyptic number.
It is an amenable number.
23646265345052 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23646265345052 is a wasteful number, since it uses less digits than its factorization.
23646265345052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844509476620 (or 844509476618 counting only the distinct ones).
The product of its (nonzero) digits is 31104000, while the sum is 53.
The spelling of 23646265345052 in words is "twenty-three trillion, six hundred forty-six billion, two hundred sixty-five million, three hundred forty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •