Base | Representation |
---|---|
bin | 10101011111010111… |
… | …011110010000000000 |
3 | 2012120010100120111011 |
4 | 111133113132100000 |
5 | 334224123401331 |
6 | 14333405330304 |
7 | 1444546530622 |
oct | 253727362000 |
9 | 65503316434 |
10 | 23074825216 |
11 | 9871156793 |
12 | 457b866994 |
13 | 223972a041 |
14 | 118c808c12 |
15 | 900b903b1 |
hex | 55f5de400 |
23074825216 has 99 divisors (see below), whose sum is σ = 47600673937. Its totient is φ = 11180134400.
The previous prime is 23074825159. The next prime is 23074825217. The reversal of 23074825216 is 61252847032.
The square root of 23074825216 is 151904.
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., 22170018816 + 904806400 = 148896^2 + 30080^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23074825217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 228463566 + ... + 228463666.
Almost surely, 223074825216 is an apocalyptic number.
23074825216 is the 151904-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23074825216
23074825216 is an abundant number, since it is smaller than the sum of its proper divisors (24525848721).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23074825216 is an frugal number, since it uses more digits than its factorization.
23074825216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316 (or 150 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 40.
The spelling of 23074825216 in words is "twenty-three billion, seventy-four million, eight hundred twenty-five thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •