Base | Representation |
---|---|
bin | 11111001110110100001… |
… | …111000011100010101101 |
3 | 21121011202020111202121012 |
4 | 133032310033003202231 |
5 | 240130420401320003 |
6 | 4321542330515005 |
7 | 311026101320555 |
oct | 37166417034255 |
9 | 7534666452535 |
10 | 2146212526253 |
11 | 758227023944 |
12 | 2a7b4a295a65 |
13 | 127505243ab3 |
14 | 75c3d210165 |
15 | 3ac643178d8 |
hex | 1f3b43c38ad |
2146212526253 has 8 divisors (see below), whose sum is σ = 2146799276160. Its totient is φ = 2145625867440.
The previous prime is 2146212526201. The next prime is 2146212526319. The reversal of 2146212526253 is 3526252126412.
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 2146212526253 - 224 = 2146195749037 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2146212526253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2146212526153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81261176 + ... + 81287582.
It is an arithmetic number, because the mean of its divisors is an integer number (268349909520).
Almost surely, 22146212526253 is an apocalyptic number.
It is an amenable number.
2146212526253 is a deficient number, since it is larger than the sum of its proper divisors (586749907).
2146212526253 is a wasteful number, since it uses less digits than its factorization.
2146212526253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45547.
The product of its digits is 345600, while the sum is 41.
The spelling of 2146212526253 in words is "two trillion, one hundred forty-six billion, two hundred twelve million, five hundred twenty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •