Base | Representation |
---|---|
bin | 1111101001110101… |
… | …1001101011000011 |
3 | 101211211211021220022 |
4 | 3322131121223003 |
5 | 32101203330311 |
6 | 1532543404055 |
7 | 206062335620 |
oct | 37235315303 |
9 | 11754737808 |
10 | 4202011331 |
11 | 1866a20341 |
12 | 9932b362b |
13 | 51c73134b |
14 | 2bc0db347 |
15 | 198d7a5db |
hex | fa759ac3 |
4202011331 has 8 divisors (see below), whose sum is σ = 4821433344. Its totient is φ = 3587373000.
The previous prime is 4202011313. The next prime is 4202011339. The reversal of 4202011331 is 1331102024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4202011331 - 226 = 4134902467 is a prime.
It is a super-3 number, since 3×42020113313 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (4202011339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1194035 + ... + 1197548.
It is an arithmetic number, because the mean of its divisors is an integer number (602679168).
Almost surely, 24202011331 is an apocalyptic number.
4202011331 is a deficient number, since it is larger than the sum of its proper divisors (619422013).
4202011331 is a wasteful number, since it uses less digits than its factorization.
4202011331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2391841.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 4202011331 is about 64822.9228822644. The cubic root of 4202011331 is about 1613.6861556412.
Adding to 4202011331 its reverse (1331102024), we get a palindrome (5533113355).
The spelling of 4202011331 in words is "four billion, two hundred two million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •