Base | Representation |
---|---|
bin | 111010100001010000101… |
… | …001010111011010010101 |
3 | 112020110001020100222220102 |
4 | 322201100221113122111 |
5 | 1011341403224111013 |
6 | 12315231455143445 |
7 | 563353043326301 |
oct | 72412051273225 |
9 | 15213036328812 |
10 | 4021442410133 |
11 | 1310536446785 |
12 | 54b470b14b85 |
13 | 2322b3280695 |
14 | dc8d3016d01 |
15 | 6e918696d58 |
hex | 3a850a57695 |
4021442410133 has 8 divisors (see below), whose sum is σ = 4024188168000. Its totient is φ = 4018697170848.
The previous prime is 4021442410121. The next prime is 4021442410177. The reversal of 4021442410133 is 3310142441204.
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 4021442410133 - 228 = 4021173974677 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4021442410096 and 4021442410105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4021442410633) 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, 16071818 + ... + 16320116.
It is an arithmetic number, because the mean of its divisors is an integer number (503023521000).
Almost surely, 24021442410133 is an apocalyptic number.
It is an amenable number.
4021442410133 is a deficient number, since it is larger than the sum of its proper divisors (2745757867).
4021442410133 is a wasteful number, since it uses less digits than its factorization.
4021442410133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259291.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 4021442410133 its reverse (3310142441204), we get a palindrome (7331584851337).
The spelling of 4021442410133 in words is "four trillion, twenty-one billion, four hundred forty-two million, four hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •