Base | Representation |
---|---|
bin | 10101100001100110… |
… | …010000001001100100 |
3 | 2012122201210011012100 |
4 | 111201212100021210 |
5 | 334313214112202 |
6 | 14341223452100 |
7 | 1445512626606 |
oct | 254146201144 |
9 | 65581704170 |
10 | 23112254052 |
11 | 98902a0608 |
12 | 45902b7030 |
13 | 2244403494 |
14 | 119378d176 |
15 | 9040d541c |
hex | 561990264 |
23112254052 has 72 divisors (see below), whose sum is σ = 62426964600. Its totient is φ = 7184360448.
The previous prime is 23112254041. The next prime is 23112254057. The reversal of 23112254052 is 25045221132.
23112254052 is a `hidden beast` number, since 2 + 3 + 112 + 2 + 540 + 5 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 10335568896 + 12776685156 = 101664^2 + 113034^2 .
It is not an unprimeable number, because it can be changed into a prime (23112254057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 106527 + ... + 239942.
It is an arithmetic number, because the mean of its divisors is an integer number (867041175).
Almost surely, 223112254052 is an apocalyptic number.
It is an amenable number.
23112254052 is an abundant number, since it is smaller than the sum of its proper divisors (39314710548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23112254052 is a wasteful number, since it uses less digits than its factorization.
23112254052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346605 (or 346600 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 23112254052 its reverse (25045221132), we get a palindrome (48157475184).
The spelling of 23112254052 in words is "twenty-three billion, one hundred twelve million, two hundred fifty-four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •