Base | Representation |
---|---|
bin | 1011010100100110… |
… | …0111001111000101 |
3 | 21211210210011021120 |
4 | 2311021213033011 |
5 | 22211013233401 |
6 | 1221324304153 |
7 | 135212512014 |
oct | 26511471705 |
9 | 7753704246 |
10 | 3039196101 |
11 | 131a602017 |
12 | 7099a2059 |
13 | 3958591b6 |
14 | 20b8caa7b |
15 | 12bc37836 |
hex | b52673c5 |
3039196101 has 8 divisors (see below), whose sum is σ = 4068406944. Its totient is φ = 2018058000.
The previous prime is 3039196049. The next prime is 3039196157. The reversal of 3039196101 is 1016919303.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3039196101 - 26 = 3039196037 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3039196001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2017306 + ... + 2018811.
It is an arithmetic number, because the mean of its divisors is an integer number (508550868).
Almost surely, 23039196101 is an apocalyptic number.
It is an amenable number.
3039196101 is a deficient number, since it is larger than the sum of its proper divisors (1029210843).
3039196101 is a wasteful number, since it uses less digits than its factorization.
3039196101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4036371.
The product of its (nonzero) digits is 4374, while the sum is 33.
The square root of 3039196101 is about 55128.9044059466. The cubic root of 3039196101 is about 1448.5035851893.
The spelling of 3039196101 in words is "three billion, thirty-nine million, one hundred ninety-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •