Base | Representation |
---|---|
bin | 111111010110001… |
… | …0000110011111011 |
3 | 12111010120020022122 |
4 | 1332230100303323 |
5 | 13323114014121 |
6 | 550525311455 |
7 | 103446504332 |
oct | 17654206373 |
9 | 5433506278 |
10 | 2125532411 |
11 | 9a0897a62 |
12 | 4b3a0558b |
13 | 27b48a4b2 |
14 | 162414d19 |
15 | c690c5ab |
hex | 7eb10cfb |
2125532411 has 8 divisors (see below), whose sum is σ = 2159854944. Its totient is φ = 2091473280.
The previous prime is 2125532393. The next prime is 2125532417. The reversal of 2125532411 is 1142355212.
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 2125532411 - 214 = 2125516027 is a prime.
It is a super-2 number, since 2×21255324112 = 9035776060422945842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2125532417) 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, 49550 + ... + 81891.
It is an arithmetic number, because the mean of its divisors is an integer number (269981868).
Almost surely, 22125532411 is an apocalyptic number.
2125532411 is a deficient number, since it is larger than the sum of its proper divisors (34322533).
2125532411 is a wasteful number, since it uses less digits than its factorization.
2125532411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131701.
The product of its digits is 2400, while the sum is 26.
The square root of 2125532411 is about 46103.4967328943. The cubic root of 2125532411 is about 1285.7481572341.
Adding to 2125532411 its reverse (1142355212), we get a palindrome (3267887623).
The spelling of 2125532411 in words is "two billion, one hundred twenty-five million, five hundred thirty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •