Base | Representation |
---|---|
bin | 111010100001001000111… |
… | …100000110110001111110 |
3 | 112020102201020001121122020 |
4 | 322201020330012301332 |
5 | 1011341122123330042 |
6 | 12315210555501010 |
7 | 563346613261413 |
oct | 72411074066176 |
9 | 15212636047566 |
10 | 4021313105022 |
11 | 131047a459954 |
12 | 54b435757766 |
13 | 232292549295 |
14 | dc8bdb9810a |
15 | 6e90c1543ec |
hex | 3a848f06c7e |
4021313105022 has 8 divisors (see below), whose sum is σ = 8042626210056. Its totient is φ = 1340437701672.
The previous prime is 4021313105009. The next prime is 4021313105071. The reversal of 4021313105022 is 2205013131204.
4021313105022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
4021313105022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 4021313104983 and 4021313105001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 335109425413 + ... + 335109425424.
It is an arithmetic number, because the mean of its divisors is an integer number (1005328276257).
Almost surely, 24021313105022 is an apocalyptic number.
4021313105022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4021313105022 is a wasteful number, since it uses less digits than its factorization.
4021313105022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670218850842.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 4021313105022 its reverse (2205013131204), we get a palindrome (6226326236226).
The spelling of 4021313105022 in words is "four trillion, twenty-one billion, three hundred thirteen million, one hundred five thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •