Base | Representation |
---|---|
bin | 11110010010000110101… |
… | …011001110110011100111 |
3 | 21100221111010010210012210 |
4 | 132102012223032303213 |
5 | 233043414023313142 |
6 | 4232001543014503 |
7 | 303230464114035 |
oct | 36220653166347 |
9 | 7327433123183 |
10 | 2081023651047 |
11 | 732614665070 |
12 | 29739673a433 |
13 | 121316797563 |
14 | 72a17571555 |
15 | 391eb2a049c |
hex | 1e486acece7 |
2081023651047 has 64 divisors (see below), whose sum is σ = 3191863449600. Its totient is φ = 1194402894720.
The previous prime is 2081023651043. The next prime is 2081023651139. The reversal of 2081023651047 is 7401563201802.
It is not a de Polignac number, because 2081023651047 - 22 = 2081023651043 is a prime.
It is a super-3 number, since 3×20810236510473 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2081023650996 and 2081023651014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2081023651043) 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 63 ways as a sum of consecutive naturals, for example, 10946668 + ... + 11135150.
It is an arithmetic number, because the mean of its divisors is an integer number (49872866400).
Almost surely, 22081023651047 is an apocalyptic number.
2081023651047 is a deficient number, since it is larger than the sum of its proper divisors (1110839798553).
2081023651047 is a wasteful number, since it uses less digits than its factorization.
2081023651047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188748.
The product of its (nonzero) digits is 80640, while the sum is 39.
Adding to 2081023651047 its reverse (7401563201802), we get a palindrome (9482586852849).
The spelling of 2081023651047 in words is "two trillion, eighty-one billion, twenty-three million, six hundred fifty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •