Base | Representation |
---|---|
bin | 10010101111010000… |
… | …000110010100110101 |
3 | 1220221012112002111021 |
4 | 102233100012110311 |
5 | 312201221232242 |
6 | 13124255341141 |
7 | 1311411022036 |
oct | 225720062465 |
9 | 56835462437 |
10 | 20120102197 |
11 | 8595300638 |
12 | 3a962217b1 |
13 | 1b88539220 |
14 | d8c22aa8d |
15 | 7cb591b67 |
hex | 4af406535 |
20120102197 has 4 divisors (see below), whose sum is σ = 21667802380. Its totient is φ = 18572402016.
The previous prime is 20120102161. The next prime is 20120102209. The reversal of 20120102197 is 79120102102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 79120102102 = 2 ⋅39560051051.
It can be written as a sum of positive squares in 2 ways, for example, as 6535267281 + 13584834916 = 80841^2 + 116554^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20120102197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120100197) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 773850072 + ... + 773850097.
It is an arithmetic number, because the mean of its divisors is an integer number (5416950595).
Almost surely, 220120102197 is an apocalyptic number.
It is an amenable number.
20120102197 is a deficient number, since it is larger than the sum of its proper divisors (1547700183).
20120102197 is a wasteful number, since it uses less digits than its factorization.
20120102197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1547700182.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 20120102197 its reverse (79120102102), we get a palindrome (99240204299).
The spelling of 20120102197 in words is "twenty billion, one hundred twenty million, one hundred two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •