Base | Representation |
---|---|
bin | 1111101001100111… |
… | …0010011100100111 |
3 | 101211210001011201112 |
4 | 3322121302130213 |
5 | 32100433023411 |
6 | 1532511215235 |
7 | 206051312450 |
oct | 37231623447 |
9 | 11753034645 |
10 | 4201064231 |
11 | 1866433811 |
12 | 992b1751b |
13 | 51c48c230 |
14 | 2bbd32127 |
15 | 198c3eb8b |
hex | fa672727 |
4201064231 has 32 divisors (see below), whose sum is σ = 5350195200. Its totient is φ = 3208947840.
The previous prime is 4201064209. The next prime is 4201064243. The reversal of 4201064231 is 1324601024.
It is not a de Polignac number, because 4201064231 - 214 = 4201047847 is a prime.
It is a super-2 number, since 2×42010642312 = 35297881345975242722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4201064197 and 4201064206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4201064251) 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 31 ways as a sum of consecutive naturals, for example, 1349705 + ... + 1352813.
It is an arithmetic number, because the mean of its divisors is an integer number (167193600).
Almost surely, 24201064231 is an apocalyptic number.
4201064231 is a deficient number, since it is larger than the sum of its proper divisors (1149130969).
4201064231 is a wasteful number, since it uses less digits than its factorization.
4201064231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3639.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 4201064231 is about 64815.6171844410. The cubic root of 4201064231 is about 1613.5649091812.
Adding to 4201064231 its reverse (1324601024), we get a palindrome (5525665255).
The spelling of 4201064231 in words is "four billion, two hundred one million, sixty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •