Base | Representation |
---|---|
bin | 1111101100000101… |
… | …0111101001100111 |
3 | 101212111120022220211 |
4 | 3323001113221213 |
5 | 32111112041411 |
6 | 1533521440251 |
7 | 206235436255 |
oct | 37301275147 |
9 | 11774508824 |
10 | 4211440231 |
11 | 1871280419 |
12 | 9964a0087 |
13 | 521682c8b |
14 | 2bd4735d5 |
15 | 199ade221 |
hex | fb057a67 |
4211440231 has 16 divisors (see below), whose sum is σ = 4630752000. Its totient is φ = 3812263488.
The previous prime is 4211440229. The next prime is 4211440249. The reversal of 4211440231 is 1320441124.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 4211440231 - 21 = 4211440229 is a prime.
It is a super-2 number, since 2×42114402312 = 35472457638570666722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4211440031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 453820 + ... + 463006.
It is an arithmetic number, because the mean of its divisors is an integer number (289422000).
Almost surely, 24211440231 is an apocalyptic number.
4211440231 is a deficient number, since it is larger than the sum of its proper divisors (419311769).
4211440231 is a wasteful number, since it uses less digits than its factorization.
4211440231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10278.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 4211440231 is about 64895.6102598627. The cubic root of 4211440231 is about 1614.8922383023.
Adding to 4211440231 its reverse (1320441124), we get a palindrome (5531881355).
The spelling of 4211440231 in words is "four billion, two hundred eleven million, four hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •