Base | Representation |
---|---|
bin | 111100110101010… |
… | …0111010010100000 |
3 | 12021020220102100200 |
4 | 1321222213102200 |
5 | 13140022322422 |
6 | 534314145200 |
7 | 101404014360 |
oct | 17152472240 |
9 | 5236812320 |
10 | 2041214112 |
11 | 958237413 |
12 | 48b722200 |
13 | 266b77702 |
14 | 1551469a0 |
15 | be3042ac |
hex | 79aa74a0 |
2041214112 has 72 divisors (see below), whose sum is σ = 6633952416. Its totient is φ = 583203456.
The previous prime is 2041214111. The next prime is 2041214117. The reversal of 2041214112 is 2114121402.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (2041214111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 504238 + ... + 508269.
It is an arithmetic number, because the mean of its divisors is an integer number (92138228).
Almost surely, 22041214112 is an apocalyptic number.
It is an amenable number.
2041214112 is an abundant number, since it is smaller than the sum of its proper divisors (4592738304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2041214112 is a wasteful number, since it uses less digits than its factorization.
2041214112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012530 (or 1012519 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
The square root of 2041214112 is about 45179.7976091084. The cubic root of 2041214112 is about 1268.5166950889.
Adding to 2041214112 its reverse (2114121402), we get a palindrome (4155335514).
It can be divided in two parts, 2041 and 214112, that added together give a triangular number (216153 = T657).
The spelling of 2041214112 in words is "two billion, forty-one million, two hundred fourteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •