Base | Representation |
---|---|
bin | 101111110000000011000100… |
… | …001011010011010001110001 |
3 | 1000112120202112211120212122200 |
4 | 233300003010023103101301 |
5 | 210011301001110431342 |
6 | 2022353133454453413 |
7 | 62143502610204522 |
oct | 5760030413232161 |
9 | 1015522484525580 |
10 | 210010012202097 |
11 | 60a08822a35a58 |
12 | 1b679420204269 |
13 | 9024b227b7833 |
14 | 39c0778770849 |
15 | 1942c97ea094c |
hex | bf00c42d3471 |
210010012202097 has 12 divisors (see below), whose sum is σ = 313808064210420. Its totient is φ = 135178858428768.
The previous prime is 210010012202093. The next prime is 210010012202147. The reversal of 210010012202097 is 790202210010012.
It can be written as a sum of positive squares in 2 ways, for example, as 161586910115856 + 48423102086241 = 12711684^2 + 6958671^2 .
It is not a de Polignac number, because 210010012202097 - 22 = 210010012202093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210010012202097.
It is not an unprimeable number, because it can be changed into a prime (210010012202093) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 402318030778 + ... + 402318031299.
It is an arithmetic number, because the mean of its divisors is an integer number (26150672017535).
Almost surely, 2210010012202097 is an apocalyptic number.
It is an amenable number.
210010012202097 is a deficient number, since it is larger than the sum of its proper divisors (103798052008323).
210010012202097 is a wasteful number, since it uses less digits than its factorization.
210010012202097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804636062112 (or 804636062109 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The spelling of 210010012202097 in words is "two hundred ten trillion, ten billion, twelve million, two hundred two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •