Base | Representation |
---|---|
bin | 111111010011010… |
… | …0100100011011101 |
3 | 12111000202102200110 |
4 | 1332212210203131 |
5 | 13322223243123 |
6 | 550433320233 |
7 | 103431021435 |
oct | 17646444335 |
9 | 5430672613 |
10 | 2124040413 |
11 | 99aa69000 |
12 | 4b3406079 |
13 | 27b087361 |
14 | 1621472c5 |
15 | c6715493 |
hex | 7e9a48dd |
2124040413 has 32 divisors (see below), whose sum is σ = 3124082304. Its totient is φ = 1283568000.
The previous prime is 2124040411. The next prime is 2124040421. The reversal of 2124040413 is 3140404212.
It is not a de Polignac number, because 2124040413 - 21 = 2124040411 is a prime.
It is a Smith number, since the sum of its digits (21) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2124040413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2124040411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2079843 + ... + 2080863.
It is an arithmetic number, because the mean of its divisors is an integer number (97627572).
Almost surely, 22124040413 is an apocalyptic number.
It is an amenable number.
2124040413 is a deficient number, since it is larger than the sum of its proper divisors (1000041891).
2124040413 is a wasteful number, since it uses less digits than its factorization.
2124040413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1578 (or 1556 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 2124040413 is about 46087.3129288311. The cubic root of 2124040413 is about 1285.4472471034.
Adding to 2124040413 its reverse (3140404212), we get a palindrome (5264444625).
The spelling of 2124040413 in words is "two billion, one hundred twenty-four million, forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •