Base | Representation |
---|---|
bin | 1111101001110101… |
… | …1010011001011101 |
3 | 101211211211102222022 |
4 | 3322131122121131 |
5 | 32101203424201 |
6 | 1532543425525 |
7 | 206062350362 |
oct | 37235323135 |
9 | 11754742868 |
10 | 4202014301 |
11 | 1866a225a1 |
12 | 9932b52a5 |
13 | 51c7327c4 |
14 | 2bc0dc469 |
15 | 198d7b41b |
hex | fa75a65d |
4202014301 has 4 divisors (see below), whose sum is σ = 4215701952. Its totient is φ = 4188326652.
The previous prime is 4202014237. The next prime is 4202014303. The reversal of 4202014301 is 1034102024.
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.
It is a cyclic number.
It is not a de Polignac number, because 4202014301 - 26 = 4202014237 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 4202014301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4202014303) 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, 6843365 + ... + 6843978.
It is an arithmetic number, because the mean of its divisors is an integer number (1053925488).
Almost surely, 24202014301 is an apocalyptic number.
It is an amenable number.
4202014301 is a deficient number, since it is larger than the sum of its proper divisors (13687651).
4202014301 is a wasteful number, since it uses less digits than its factorization.
4202014301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13687650.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 4202014301 is about 64822.9457908232. The cubic root of 4202014301 is about 1613.6865358279.
Adding to 4202014301 its reverse (1034102024), we get a palindrome (5236116325).
The spelling of 4202014301 in words is "four billion, two hundred two million, fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •