Base | Representation |
---|---|
bin | 1100001010110001111… |
… | …1000010000000100011 |
3 | 201222121012200102121200 |
4 | 3002230133002000203 |
5 | 11411114333333201 |
6 | 240012015052243 |
7 | 21050336525625 |
oct | 3025437020043 |
9 | 658535612550 |
10 | 209052246051 |
11 | 807275a7690 |
12 | 34623211083 |
13 | 16937862c9c |
14 | a192416c15 |
15 | 5688021386 |
hex | 30ac7c2023 |
209052246051 has 48 divisors (see below), whose sum is σ = 330879669120. Its totient is φ = 126136080000.
The previous prime is 209052246043. The next prime is 209052246113. The reversal of 209052246051 is 150642250902.
209052246051 is a `hidden beast` number, since 2 + 0 + 90 + 522 + 46 + 0 + 5 + 1 = 666.
It is not a de Polignac number, because 209052246051 - 23 = 209052246043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 209052245997 and 209052246015.
It is not an unprimeable number, because it can be changed into a prime (209052246041) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40362780 + ... + 40367958.
It is an arithmetic number, because the mean of its divisors is an integer number (6893326440).
Almost surely, 2209052246051 is an apocalyptic number.
209052246051 is a deficient number, since it is larger than the sum of its proper divisors (121827423069).
209052246051 is a wasteful number, since it uses less digits than its factorization.
209052246051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6928 (or 6925 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 209052246051 its reverse (150642250902), we get a palindrome (359694496953).
The spelling of 209052246051 in words is "two hundred nine billion, fifty-two million, two hundred forty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •