Base | Representation |
---|---|
bin | 10011001110011100… |
… | …10101110100010000 |
3 | 222122100012002022221 |
4 | 21213032111310100 |
5 | 132114331402331 |
6 | 4424114510424 |
7 | 513532255324 |
oct | 114716256420 |
9 | 28570162287 |
10 | 10321747216 |
11 | 44173a2500 |
12 | 2000895414 |
13 | c86560a41 |
14 | 6dcb97984 |
15 | 406265711 |
hex | 267395d10 |
10321747216 has 45 divisors (see below), whose sum is σ = 21991220293. Its totient is φ = 4689671360.
The previous prime is 10321747211. The next prime is 10321747229. The reversal of 10321747216 is 61274712301.
The square root of 10321747216 is 101596.
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., 8611097616 + 1710649600 = 92796^2 + 41360^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10321747211) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4469070 + ... + 4471378.
Almost surely, 210321747216 is an apocalyptic number.
10321747216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
10321747216 is the 101596-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10321747216
10321747216 is an abundant number, since it is smaller than the sum of its proper divisors (11669473077).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10321747216 is an frugal number, since it uses more digits than its factorization.
10321747216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4648 (or 2322 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 34.
The spelling of 10321747216 in words is "ten billion, three hundred twenty-one million, seven hundred forty-seven thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •