Base | Representation |
---|---|
bin | 111110101001110… |
… | …1101011000110011 |
3 | 12102111212212000110 |
4 | 1331103231120303 |
5 | 13301143144033 |
6 | 544335552403 |
7 | 103045261605 |
oct | 17523553063 |
9 | 5374785013 |
10 | 2102318643 |
11 | 989782127 |
12 | 4a808b703 |
13 | 276720339 |
14 | 15d2d1175 |
15 | c4874363 |
hex | 7d4ed633 |
2102318643 has 8 divisors (see below), whose sum is σ = 2828808400. Its totient is φ = 1388687328.
The previous prime is 2102318623. The next prime is 2102318689. The reversal of 2102318643 is 3468132012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2102318643 - 212 = 2102314547 is a prime.
It is a super-2 number, since 2×21023186432 = 8839487353410722898, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2102318643.
It is not an unprimeable number, because it can be changed into a prime (2102318623) 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 7 ways as a sum of consecutive naturals, for example, 3214228 + ... + 3214881.
It is an arithmetic number, because the mean of its divisors is an integer number (353601050).
Almost surely, 22102318643 is an apocalyptic number.
2102318643 is a deficient number, since it is larger than the sum of its proper divisors (726489757).
2102318643 is a wasteful number, since it uses less digits than its factorization.
2102318643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6429221.
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 2102318643 is about 45851.0484394850. The cubic root of 2102318643 is about 1281.0502941628.
The spelling of 2102318643 in words is "two billion, one hundred two million, three hundred eighteen thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •