Base | Representation |
---|---|
bin | 10010000100011000… |
… | …11010100001011100 |
3 | 221001001011201002002 |
4 | 21002030122201130 |
5 | 124331311011322 |
6 | 4242323021432 |
7 | 462246522665 |
oct | 110214324134 |
9 | 27031151062 |
10 | 9700485212 |
11 | 4128742130 |
12 | 1a6880a878 |
13 | bb792c4a2 |
14 | 68047836c |
15 | 3bb947c92 |
hex | 24231a85c |
9700485212 has 48 divisors (see below), whose sum is σ = 19036372992. Its totient is φ = 4286364480.
The previous prime is 9700485211. The next prime is 9700485227. The reversal of 9700485212 is 2125840079.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9700485211) 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 15 ways as a sum of consecutive naturals, for example, 2705573 + ... + 2709155.
It is an arithmetic number, because the mean of its divisors is an integer number (396591104).
Almost surely, 29700485212 is an apocalyptic number.
It is an amenable number.
9700485212 is a deficient number, since it is larger than the sum of its proper divisors (9335887780).
9700485212 is a wasteful number, since it uses less digits than its factorization.
9700485212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5298 (or 5296 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 9700485212 is about 98491.0412778746. The cubic root of 9700485212 is about 2132.7067949706.
The spelling of 9700485212 in words is "nine billion, seven hundred million, four hundred eighty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •