Base | Representation |
---|---|
bin | 111101001101001… |
… | …0111010101100001 |
3 | 12022010110101020100 |
4 | 1322122113111201 |
5 | 13201223403211 |
6 | 535442333013 |
7 | 101615300631 |
oct | 17232272541 |
9 | 5263411210 |
10 | 2053731681 |
11 | 964307011 |
12 | 49395a169 |
13 | 26963b161 |
14 | 156a846c1 |
15 | c0478156 |
hex | 7a697561 |
2053731681 has 6 divisors (see below), whose sum is σ = 2966501330. Its totient is φ = 1369154448.
The previous prime is 2053731661. The next prime is 2053731689. The reversal of 2053731681 is 1861373502.
2053731681 is a `hidden beast` number, since 205 + 373 + 1 + 6 + 81 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1128355281 + 925376400 = 33591^2 + 30420^2 .
It is not a de Polignac number, because 2053731681 - 225 = 2020177249 is a prime.
It is a super-2 number, since 2×20537316812 = 8435627635086171522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2053731689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 114096196 + ... + 114096213.
Almost surely, 22053731681 is an apocalyptic number.
It is an amenable number.
2053731681 is a deficient number, since it is larger than the sum of its proper divisors (912769649).
2053731681 is a wasteful number, since it uses less digits than its factorization.
2053731681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228192415 (or 228192412 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 2053731681 is about 45318.1164767469. The cubic root of 2053731681 is about 1271.1044355507.
The spelling of 2053731681 in words is "two billion, fifty-three million, seven hundred thirty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •