Base | Representation |
---|---|
bin | 1111101001101000… |
… | …0101001111101111 |
3 | 101211210012002100101 |
4 | 3322122011033233 |
5 | 32100443004411 |
6 | 1532513011531 |
7 | 206052053110 |
oct | 37232051757 |
9 | 11753162311 |
10 | 4201141231 |
11 | 1866486651 |
12 | 992b53ba7 |
13 | 51c4b82b1 |
14 | 2bbd52207 |
15 | 198c578c1 |
hex | fa6853ef |
4201141231 has 8 divisors (see below), whose sum is σ = 4966866720. Its totient is φ = 3476806368.
The previous prime is 4201141229. The next prime is 4201141247. The reversal of 4201141231 is 1321411024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4201141231 - 21 = 4201141229 is a prime.
It is a super-2 number, since 2×42011412312 = 35299175285616390722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4201141199 and 4201141208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4201141211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10347436 + ... + 10347841.
It is an arithmetic number, because the mean of its divisors is an integer number (620858340).
Almost surely, 24201141231 is an apocalyptic number.
4201141231 is a deficient number, since it is larger than the sum of its proper divisors (765725489).
4201141231 is a wasteful number, since it uses less digits than its factorization.
4201141231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20695313.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 4201141231 is about 64816.2111743659. The cubic root of 4201141231 is about 1613.5747672975.
Adding to 4201141231 its reverse (1321411024), we get a palindrome (5522552255).
The spelling of 4201141231 in words is "four billion, two hundred one million, one hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •