Base | Representation |
---|---|
bin | 111010100010101111100… |
… | …001010110000110001001 |
3 | 112020121011011111102001202 |
4 | 322202233201112012021 |
5 | 1011403133220034423 |
6 | 12320053435353545 |
7 | 563440351665236 |
oct | 72425741260611 |
9 | 15217134442052 |
10 | 4023034143113 |
11 | 1311182991287 |
12 | 54b835bb28b5 |
13 | 2324a7c8060b |
14 | dca0459878d |
15 | 6e9ad2b1728 |
hex | 3a8af856189 |
4023034143113 has 4 divisors (see below), whose sum is σ = 4045260851268. Its totient is φ = 4000807434960.
The previous prime is 4023034143083. The next prime is 4023034143179. The reversal of 4023034143113 is 3113414303204.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 119102292544 + 3903931850569 = 345112^2 + 1975837^2 .
It is a cyclic number.
It is not a de Polignac number, because 4023034143113 - 28 = 4023034142857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4023034143313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11113353806 + ... + 11113354167.
It is an arithmetic number, because the mean of its divisors is an integer number (1011315212817).
Almost surely, 24023034143113 is an apocalyptic number.
It is an amenable number.
4023034143113 is a deficient number, since it is larger than the sum of its proper divisors (22226708155).
4023034143113 is a wasteful number, since it uses less digits than its factorization.
4023034143113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22226708154.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 4023034143113 its reverse (3113414303204), we get a palindrome (7136448446317).
The spelling of 4023034143113 in words is "four trillion, twenty-three billion, thirty-four million, one hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •