Base | Representation |
---|---|
bin | 1111001000110000… |
… | …0111100110100110 |
3 | 101111011202011011111 |
4 | 3302030013212212 |
5 | 31310143410032 |
6 | 1511105455234 |
7 | 202456111141 |
oct | 36214074646 |
9 | 11434664144 |
10 | 4063263142 |
11 | 17a5673814 |
12 | 95494151a |
13 | 4c9a71a23 |
14 | 2a7901058 |
15 | 18babec47 |
hex | f23079a6 |
4063263142 has 4 divisors (see below), whose sum is σ = 6094894716. Its totient is φ = 2031631570.
The previous prime is 4063263119. The next prime is 4063263163. The reversal of 4063263142 is 2413623604.
4063263142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×40632631422 = 33020214722271424328, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
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, 1015815784 + ... + 1015815787.
It is an arithmetic number, because the mean of its divisors is an integer number (1523723679).
Almost surely, 24063263142 is an apocalyptic number.
4063263142 is a deficient number, since it is larger than the sum of its proper divisors (2031631574).
4063263142 is a wasteful number, since it uses less digits than its factorization.
4063263142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2031631573.
The product of its (nonzero) digits is 20736, while the sum is 31.
The square root of 4063263142 is about 63743.7302171751. The cubic root of 4063263142 is about 1595.7259814255.
Adding to 4063263142 its reverse (2413623604), we get a palindrome (6476886746).
The spelling of 4063263142 in words is "four billion, sixty-three million, two hundred sixty-three thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •