Base | Representation |
---|---|
bin | 1111101001011100… |
… | …0001111110101110 |
3 | 101211201200110012211 |
4 | 3322113001332232 |
5 | 32100241411142 |
6 | 1532443521034 |
7 | 206042212234 |
oct | 37227017656 |
9 | 11751613184 |
10 | 4200341422 |
11 | 1865a8a752 |
12 | 99282917a |
13 | 51c298234 |
14 | 2bbbc4954 |
15 | 198b4a917 |
hex | fa5c1fae |
4200341422 has 4 divisors (see below), whose sum is σ = 6300512136. Its totient is φ = 2100170710.
The previous prime is 4200341413. The next prime is 4200341447. The reversal of 4200341422 is 2241430024.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×42003414222 = 35285736122737964168, which contains 22 as substring.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 4200341393 and 4200341402.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050085354 + ... + 1050085357.
It is an arithmetic number, because the mean of its divisors is an integer number (1575128034).
Almost surely, 24200341422 is an apocalyptic number.
4200341422 is a deficient number, since it is larger than the sum of its proper divisors (2100170714).
4200341422 is a wasteful number, since it uses less digits than its factorization.
4200341422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2100170713.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 4200341422 is about 64810.0410584656. The cubic root of 4200341422 is about 1613.4723638904.
Adding to 4200341422 its reverse (2241430024), we get a palindrome (6441771446).
The spelling of 4200341422 in words is "four billion, two hundred million, three hundred forty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •