Base | Representation |
---|---|
bin | 11111011101100111111… |
… | …011000111111010001001 |
3 | 21122200210022100220020221 |
4 | 133131213323013322021 |
5 | 240411001144231100 |
6 | 4333132141550041 |
7 | 312131103431101 |
oct | 37354773077211 |
9 | 7580708326227 |
10 | 2162112102025 |
11 | 763a45a08507 |
12 | 2ab046b75321 |
13 | 128b6a2683b5 |
14 | 7690aac0201 |
15 | 3b3950c301a |
hex | 1f767ec7e89 |
2162112102025 has 48 divisors (see below), whose sum is σ = 2940962145840. Its totient is φ = 1569479475200.
The previous prime is 2162112102011. The next prime is 2162112102037. The reversal of 2162112102025 is 5202012112612.
It can be written as a sum of positive squares in 24 ways, for example, as 46064749129 + 2116047352896 = 214627^2 + 1454664^2 .
It is not a de Polignac number, because 2162112102025 - 235 = 2127752363657 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8214465 + ... + 8473585.
It is an arithmetic number, because the mean of its divisors is an integer number (61270044705).
Almost surely, 22162112102025 is an apocalyptic number.
2162112102025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2162112102025 is a deficient number, since it is larger than the sum of its proper divisors (778850043815).
2162112102025 is a wasteful number, since it uses less digits than its factorization.
2162112102025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259854 (or 259849 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 2162112102025 its reverse (5202012112612), we get a palindrome (7364124214637).
The spelling of 2162112102025 in words is "two trillion, one hundred sixty-two billion, one hundred twelve million, one hundred two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •