Base | Representation |
---|---|
bin | 111111011111011… |
… | …0101110000011101 |
3 | 12111110201122121010 |
4 | 1332332311300131 |
5 | 13330340333313 |
6 | 551221525433 |
7 | 103536056343 |
oct | 17676656035 |
9 | 5443648533 |
10 | 2130402333 |
11 | 9a3613894 |
12 | 4b5573879 |
13 | 27c4a3cc7 |
14 | 162d21993 |
15 | c70704c3 |
hex | 7efb5c1d |
2130402333 has 4 divisors (see below), whose sum is σ = 2840536448. Its totient is φ = 1420268220.
The previous prime is 2130402319. The next prime is 2130402377. The reversal of 2130402333 is 3332040312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2130402333 - 26 = 2130402269 is a prime.
It is a super-2 number, since 2×21304023332 = 9077228200903685778, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2130402233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 355067053 + ... + 355067058.
It is an arithmetic number, because the mean of its divisors is an integer number (710134112).
Almost surely, 22130402333 is an apocalyptic number.
It is an amenable number.
2130402333 is a deficient number, since it is larger than the sum of its proper divisors (710134115).
2130402333 is an equidigital number, since it uses as much as digits as its factorization.
2130402333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710134114.
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 2130402333 is about 46156.2816201652. The cubic root of 2130402333 is about 1286.7293572489.
Adding to 2130402333 its reverse (3332040312), we get a palindrome (5462442645).
The spelling of 2130402333 in words is "two billion, one hundred thirty million, four hundred two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •