Base | Representation |
---|---|
bin | 111010110100100000100… |
… | …110010010010101011101 |
3 | 112022102101200012220111112 |
4 | 322310200212102111131 |
5 | 1012211220422224041 |
6 | 12332530433431405 |
7 | 565014165506513 |
oct | 72644046222535 |
9 | 15272350186445 |
10 | 4042111133021 |
11 | 13192823a2145 |
12 | 55347aa0b565 |
13 | 234228366320 |
14 | dd8d40544b3 |
15 | 70227ea7deb |
hex | 3ad2099255d |
4042111133021 has 8 divisors (see below), whose sum is σ = 4354696059000. Its totient is φ = 3729762392832.
The previous prime is 4042111133017. The next prime is 4042111133069. The reversal of 4042111133021 is 1203311112404.
It can be written as a sum of positive squares in 4 ways, for example, as 348849703225 + 3693261429796 = 590635^2 + 1921786^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4042111133021 - 22 = 4042111133017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4042111183021) 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, 59010896 + ... + 59079353.
It is an arithmetic number, because the mean of its divisors is an integer number (544337007375).
Almost surely, 24042111133021 is an apocalyptic number.
It is an amenable number.
4042111133021 is a deficient number, since it is larger than the sum of its proper divisors (312584925979).
4042111133021 is a wasteful number, since it uses less digits than its factorization.
4042111133021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118092895.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 4042111133021 its reverse (1203311112404), we get a palindrome (5245422245425).
The spelling of 4042111133021 in words is "four trillion, forty-two billion, one hundred eleven million, one hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •