Base | Representation |
---|---|
bin | 1010110000010111010011… |
… | …11101110111011101011100 |
3 | 10002202002222121102212020102 |
4 | 11120023221331313131130 |
5 | 11100003311400203202 |
6 | 122145330311040232 |
7 | 4660541662260062 |
oct | 530135175673534 |
9 | 102662877385212 |
10 | 23652015241052 |
11 | 7599843aa6830 |
12 | 279bb04070078 |
13 | 10274b5b93483 |
14 | 5baa99630032 |
15 | 2b039abb0d02 |
hex | 1582e9f7775c |
23652015241052 has 24 divisors (see below), whose sum is σ = 45725414972160. Its totient is φ = 10614828472560.
The previous prime is 23652015241051. The next prime is 23652015241081. The reversal of 23652015241052 is 25014251025632.
It is a junction number, because it is equal to n+sod(n) for n = 23652015240997 and 23652015241015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23652015241051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3402185138 + ... + 3402192089.
It is an arithmetic number, because the mean of its divisors is an integer number (1905225623840).
Almost surely, 223652015241052 is an apocalyptic number.
23652015241052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23652015241052 is a deficient number, since it is larger than the sum of its proper divisors (22073399731108).
23652015241052 is a wasteful number, since it uses less digits than its factorization.
23652015241052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6804377321 (or 6804377319 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 23652015241052 its reverse (25014251025632), we get a palindrome (48666266266684).
The spelling of 23652015241052 in words is "twenty-three trillion, six hundred fifty-two billion, fifteen million, two hundred forty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •