Base | Representation |
---|---|
bin | 10101100000101010… |
… | …111011111001000000 |
3 | 2012121122112011022211 |
4 | 111200222323321000 |
5 | 334300224021301 |
6 | 14335510311504 |
7 | 1445233515061 |
oct | 254052737100 |
9 | 65548464284 |
10 | 23096704576 |
11 | 9882540000 |
12 | 4587058594 |
13 | 224111a9ca |
14 | 11916a2568 |
15 | 902a63051 |
hex | 560abbe40 |
23096704576 has 105 divisors (see below), whose sum is σ = 50738625345. Its totient is φ = 10431632640.
The previous prime is 23096704573. The next prime is 23096704591. The reversal of 23096704576 is 67540769032.
The square root of 23096704576 is 151976.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 6769998400 + 16326706176 = 82280^2 + 127776^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23096704573) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 147112690 + ... + 147112846.
Almost surely, 223096704576 is an apocalyptic number.
23096704576 is the 151976-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23096704576
23096704576 is an abundant number, since it is smaller than the sum of its proper divisors (27641920769).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23096704576 is an frugal number, since it uses more digits than its factorization.
23096704576 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370 (or 170 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 49.
Multiplying 23096704576 by its sum of digits (49), we get a square (1131738524224 = 10638322).
The spelling of 23096704576 in words is "twenty-three billion, ninety-six million, seven hundred four thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •