Base | Representation |
---|---|
bin | 1011010000000011… |
… | …0110000010000011 |
3 | 21210110220000001112 |
4 | 2310000312002003 |
5 | 22141122321240 |
6 | 1215403353535 |
7 | 134561412101 |
oct | 26400660203 |
9 | 7713800045 |
10 | 3020120195 |
11 | 130a863004 |
12 | 7035228ab |
13 | 39190a591 |
14 | 209162c71 |
15 | 12a21a665 |
hex | b4036083 |
3020120195 has 4 divisors (see below), whose sum is σ = 3624144240. Its totient is φ = 2416096152.
The previous prime is 3020120183. The next prime is 3020120221. The reversal of 3020120195 is 5910210203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3020120195 - 214 = 3020103811 is a prime.
It is a super-2 number, since 2×30201201952 = 18242251984493676050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3020120195.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 302012015 + ... + 302012024.
It is an arithmetic number, because the mean of its divisors is an integer number (906036060).
Almost surely, 23020120195 is an apocalyptic number.
3020120195 is a deficient number, since it is larger than the sum of its proper divisors (604024045).
3020120195 is an equidigital number, since it uses as much as digits as its factorization.
3020120195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604024044.
The product of its (nonzero) digits is 540, while the sum is 23.
The square root of 3020120195 is about 54955.6202312375. The cubic root of 3020120195 is about 1445.4666492502.
Adding to 3020120195 its reverse (5910210203), we get a palindrome (8930330398).
The spelling of 3020120195 in words is "three billion, twenty million, one hundred twenty thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •