Base | Representation |
---|---|
bin | 111010100001010000110… |
… | …001000111001111000111 |
3 | 112020110001101012011202212 |
4 | 322201100301013033013 |
5 | 1011341404234103111 |
6 | 12315232010454035 |
7 | 563353066515263 |
oct | 72412061071707 |
9 | 15213041164685 |
10 | 4021444441031 |
11 | 1310537603606 |
12 | 54b47173431b |
13 | 2322b3811bb4 |
14 | dc8d33c50a3 |
15 | 6e91894898b |
hex | 3a850c473c7 |
4021444441031 has 8 divisors (see below), whose sum is σ = 4037155993728. Its totient is φ = 4005750715000.
The previous prime is 4021444441009. The next prime is 4021444441057. The reversal of 4021444441031 is 1301444441204.
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 4021444441031 - 210 = 4021444440007 is a prime.
It is a super-3 number, since 3×40214444410313 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4021444441331) 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, 4004525 + ... + 4907046.
It is an arithmetic number, because the mean of its divisors is an integer number (504644499216).
Almost surely, 24021444441031 is an apocalyptic number.
4021444441031 is a deficient number, since it is larger than the sum of its proper divisors (15711552697).
4021444441031 is a wasteful number, since it uses less digits than its factorization.
4021444441031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8913333.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 4021444441031 its reverse (1301444441204), we get a palindrome (5322888882235).
The spelling of 4021444441031 in words is "four trillion, twenty-one billion, four hundred forty-four million, four hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •