Base | Representation |
---|---|
bin | 111110110011100… |
… | …1101010110110010 |
3 | 12102212111112220220 |
4 | 1331213031112302 |
5 | 13304000232242 |
6 | 545041313510 |
7 | 103136601504 |
oct | 17547152662 |
9 | 5385445826 |
10 | 2107430322 |
11 | 991653658 |
12 | 4a9935896 |
13 | 2777bcbba |
14 | 15dc61d74 |
15 | c5033bec |
hex | 7d9cd5b2 |
2107430322 has 32 divisors (see below), whose sum is σ = 4290105600. Its totient is φ = 689957328.
The previous prime is 2107430317. The next prime is 2107430327. The reversal of 2107430322 is 2230347012.
It is an interprime number because it is at equal distance from previous prime (2107430317) and next prime (2107430327).
It is a junction number, because it is equal to n+sod(n) for n = 2107430292 and 2107430301.
It is not an unprimeable number, because it can be changed into a prime (2107430327) 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, 574129 + ... + 577787.
It is an arithmetic number, because the mean of its divisors is an integer number (134065800).
Almost surely, 22107430322 is an apocalyptic number.
2107430322 is an abundant number, since it is smaller than the sum of its proper divisors (2182675278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2107430322 is a wasteful number, since it uses less digits than its factorization.
2107430322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5350.
The product of its (nonzero) digits is 2016, while the sum is 24.
The square root of 2107430322 is about 45906.7568229340. The cubic root of 2107430322 is about 1282.0877229667.
Adding to 2107430322 its reverse (2230347012), we get a palindrome (4337777334).
The spelling of 2107430322 in words is "two billion, one hundred seven million, four hundred thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •