Base | Representation |
---|---|
bin | 1111010100001110… |
… | …0011100100000101 |
3 | 101121112020012222000 |
4 | 3311003203210011 |
5 | 31410001200041 |
6 | 1515544255513 |
7 | 203611620132 |
oct | 36503434405 |
9 | 11545205860 |
10 | 4111350021 |
11 | 181a828139 |
12 | 968a71599 |
13 | 506a0a3bc |
14 | 2b005b589 |
15 | 190e1cbb6 |
hex | f50e3905 |
4111350021 has 16 divisors (see below), whose sum is σ = 6124547520. Its totient is φ = 2725753680.
The previous prime is 4111349987. The next prime is 4111350031. The reversal of 4111350021 is 1200531114.
4111350021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-4111350021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4111349976 and 4111350003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4111350031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 415755 + ... + 425528.
It is an arithmetic number, because the mean of its divisors is an integer number (382784220).
Almost surely, 24111350021 is an apocalyptic number.
It is an amenable number.
4111350021 is a deficient number, since it is larger than the sum of its proper divisors (2013197499).
4111350021 is a wasteful number, since it uses less digits than its factorization.
4111350021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841473 (or 841467 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 4111350021 is about 64119.8098952266. The cubic root of 4111350021 is about 1601.9962090836.
Adding to 4111350021 its reverse (1200531114), we get a palindrome (5311881135).
The spelling of 4111350021 in words is "four billion, one hundred eleven million, three hundred fifty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •