Base | Representation |
---|---|
bin | 1011101000110… |
… | …11100001000000 |
3 | 20210201010120000 |
4 | 11310123201000 |
5 | 144443132042 |
6 | 13404320000 |
7 | 2263562235 |
oct | 564334100 |
9 | 223633500 |
10 | 97630272 |
11 | 50123083 |
12 | 28843000 |
13 | 172c3cbc |
14 | cd7578c |
15 | 888774c |
hex | 5d1b840 |
97630272 has 140 divisors (see below), whose sum is σ = 297812460. Its totient is φ = 31601664.
The previous prime is 97630261. The next prime is 97630279. The reversal of 97630272 is 27203679.
It can be written as a sum of positive squares in 2 ways, for example, as 83612736 + 14017536 = 9144^2 + 3744^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (97630279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 191554 + ... + 192062.
Almost surely, 297630272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 97630272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148906230).
97630272 is an abundant number, since it is smaller than the sum of its proper divisors (200182188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97630272 is a wasteful number, since it uses less digits than its factorization.
97630272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570 (or 551 counting only the distinct ones).
The product of its (nonzero) digits is 31752, while the sum is 36.
The square root of 97630272 is about 9880.8032062176. The cubic root of 97630272 is about 460.4631001001.
The spelling of 97630272 in words is "ninety-seven million, six hundred thirty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •