Base | Representation |
---|---|
bin | 111111010000001… |
… | …0111010011110111 |
3 | 12110220200202201010 |
4 | 1332200113103313 |
5 | 13321314211203 |
6 | 550334403303 |
7 | 103411133613 |
oct | 17640272367 |
9 | 5426622633 |
10 | 2122413303 |
11 | 99a05758a |
12 | 4b2960533 |
13 | 27a93787a |
14 | 161c42343 |
15 | c64e3303 |
hex | 7e8174f7 |
2122413303 has 8 divisors (see below), whose sum is σ = 2830239216. Its totient is φ = 1414764800.
The previous prime is 2122413299. The next prime is 2122413329. The reversal of 2122413303 is 3033142212.
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 2122413303 - 22 = 2122413299 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2122413303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122413103) 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, 13338 + ... + 66503.
It is an arithmetic number, because the mean of its divisors is an integer number (353779902).
Almost surely, 22122413303 is an apocalyptic number.
2122413303 is a deficient number, since it is larger than the sum of its proper divisors (707825913).
2122413303 is an equidigital number, since it uses as much as digits as its factorization.
2122413303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88705.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 2122413303 is about 46069.6570749121. The cubic root of 2122413303 is about 1285.1189265495.
Adding to 2122413303 its reverse (3033142212), we get a palindrome (5155555515).
The spelling of 2122413303 in words is "two billion, one hundred twenty-two million, four hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •