Base | Representation |
---|---|
bin | 1001100000110… |
… | …10111011110101 |
3 | 12120011100220101 |
4 | 10300122323311 |
5 | 130412131401 |
6 | 11530234101 |
7 | 1656210121 |
oct | 460327365 |
9 | 176140811 |
10 | 79802101 |
11 | 41056555 |
12 | 22885931 |
13 | 136c12a2 |
14 | a854581 |
15 | 7015101 |
hex | 4c1aef5 |
79802101 has 4 divisors (see below), whose sum is σ = 80430592. Its totient is φ = 79173612.
The previous prime is 79802053. The next prime is 79802123. The reversal of 79802101 is 10120897.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10120897 = 23 ⋅440039.
It is a cyclic number.
It is not a de Polignac number, because 79802101 - 211 = 79800053 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 79802101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (79806101) 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, 314055 + ... + 314308.
It is an arithmetic number, because the mean of its divisors is an integer number (20107648).
Almost surely, 279802101 is an apocalyptic number.
It is an amenable number.
79802101 is a deficient number, since it is larger than the sum of its proper divisors (628491).
79802101 is a wasteful number, since it uses less digits than its factorization.
79802101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628490.
The product of its (nonzero) digits is 1008, while the sum is 28.
The square root of 79802101 is about 8933.2021694351. The cubic root of 79802101 is about 430.5313442375.
Adding to 79802101 its reverse (10120897), we get a palindrome (89922998).
The spelling of 79802101 in words is "seventy-nine million, eight hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •