Base | Representation |
---|---|
bin | 111010100011110000111… |
… | …001111010110100010101 |
3 | 112020200222121121210112112 |
4 | 322203300321322310111 |
5 | 1011412410030312041 |
6 | 12320354343200405 |
7 | 563506502003060 |
oct | 72436071726425 |
9 | 15220877553475 |
10 | 4024131104021 |
11 | 1311696110246 |
12 | 54baa1446105 |
13 | 232621308c02 |
14 | dcaaa1458d7 |
15 | 6ea24746deb |
hex | 3a8f0e7ad15 |
4024131104021 has 32 divisors (see below), whose sum is σ = 4688125083648. Its totient is φ = 3382761320640.
The previous prime is 4024131103987. The next prime is 4024131104027. The reversal of 4024131104021 is 1204011314204.
It is a cyclic number.
It is not a de Polignac number, because 4024131104021 - 238 = 3749253197077 is a prime.
It is a super-2 number, since 2×40241311040212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4024131104027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 254313716 + ... + 254329538.
It is an arithmetic number, because the mean of its divisors is an integer number (146503908864).
Almost surely, 24024131104021 is an apocalyptic number.
It is an amenable number.
4024131104021 is a deficient number, since it is larger than the sum of its proper divisors (663993979627).
4024131104021 is a wasteful number, since it uses less digits than its factorization.
4024131104021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17601.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 4024131104021 its reverse (1204011314204), we get a palindrome (5228142418225).
The spelling of 4024131104021 in words is "four trillion, twenty-four billion, one hundred thirty-one million, one hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.339 sec. • engine limits •