Base | Representation |
---|---|
bin | 11110100100001010011… |
… | …001010011101011110001 |
3 | 21102210112102101210210012 |
4 | 132210022121103223301 |
5 | 233403121313223004 |
6 | 4244525552544305 |
7 | 304515126304412 |
oct | 36441231235361 |
9 | 7383472353705 |
10 | 2100413414129 |
11 | 73a864684058 |
12 | 29b0a8252095 |
13 | 1230b6900c54 |
14 | 739367a7809 |
15 | 3998367a46e |
hex | 1e90a653af1 |
2100413414129 has 8 divisors (see below), whose sum is σ = 2134876473000. Its totient is φ = 2065951324800.
The previous prime is 2100413414101. The next prime is 2100413414153. The reversal of 2100413414129 is 9214143140012.
It can be written as a sum of positive squares in 4 ways, for example, as 330914863504 + 1769498550625 = 575252^2 + 1330225^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2100413414129 - 232 = 2096118446833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2100413414095 and 2100413414104.
It is not an unprimeable number, because it can be changed into a prime (2100413414159) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5074997 + ... + 5473245.
It is an arithmetic number, because the mean of its divisors is an integer number (266859559125).
Almost surely, 22100413414129 is an apocalyptic number.
It is an amenable number.
2100413414129 is a deficient number, since it is larger than the sum of its proper divisors (34463058871).
2100413414129 is an equidigital number, since it uses as much as digits as its factorization.
2100413414129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484771.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 2100413414129 in words is "two trillion, one hundred billion, four hundred thirteen million, four hundred fourteen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •