Base | Representation |
---|---|
bin | 11110111011001011000… |
… | …111100001110011010011 |
3 | 21112011022101012022121210 |
4 | 132323023013201303103 |
5 | 234304222111430111 |
6 | 4304133430551203 |
7 | 306351331331100 |
oct | 36731307416323 |
9 | 7464271168553 |
10 | 2125121592531 |
11 | 74a293812203 |
12 | 2a3a42b08503 |
13 | 125523841062 |
14 | 74bdc0a9aa7 |
15 | 3a42c9070a6 |
hex | 1eecb1e1cd3 |
2125121592531 has 12 divisors (see below), whose sum is σ = 3296106960072. Its totient is φ = 1214355195648.
The previous prime is 2125121592521. The next prime is 2125121592533. The reversal of 2125121592531 is 1352951215212.
It is not a de Polignac number, because 2125121592531 - 27 = 2125121592403 is a prime.
It is a super-2 number, since 2×21251215925312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2125121592531.
It is not an unprimeable number, because it can be changed into a prime (2125121592533) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7228304590 + ... + 7228304883.
It is an arithmetic number, because the mean of its divisors is an integer number (274675580006).
Almost surely, 22125121592531 is an apocalyptic number.
2125121592531 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2125121592531 is a deficient number, since it is larger than the sum of its proper divisors (1170985367541).
2125121592531 is a wasteful number, since it uses less digits than its factorization.
2125121592531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14456609490 (or 14456609483 counting only the distinct ones).
The product of its digits is 54000, while the sum is 39.
The spelling of 2125121592531 in words is "two trillion, one hundred twenty-five billion, one hundred twenty-one million, five hundred ninety-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.786 sec. • engine limits •