Base | Representation |
---|---|
bin | 100111110000000110001… |
… | …110110011000010111011 |
3 | 100200011000010112020121210 |
4 | 213300012032303002323 |
5 | 324224012124231101 |
6 | 5450532151334203 |
7 | 401234110461132 |
oct | 47600616630273 |
9 | 10604003466553 |
10 | 2731703742651 |
11 | 963566602594 |
12 | 38150a081363 |
13 | 16a7a2053340 |
14 | 963025ba919 |
15 | 4b0d05517d6 |
hex | 27c063b30bb |
2731703742651 has 16 divisors (see below), whose sum is σ = 3944117384480. Its totient is φ = 1671760892160.
The previous prime is 2731703742623. The next prime is 2731703742659. The reversal of 2731703742651 is 1562473071372.
2731703742651 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2731703742651 - 25 = 2731703742619 is a prime.
It is a super-2 number, since 2×27317037426512 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2731703742651.
It is not an unprimeable number, because it can be changed into a prime (2731703742659) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 193483786 + ... + 193497903.
It is an arithmetic number, because the mean of its divisors is an integer number (246507336530).
Almost surely, 22731703742651 is an apocalyptic number.
2731703742651 is a deficient number, since it is larger than the sum of its proper divisors (1212413641829).
2731703742651 is a wasteful number, since it uses less digits than its factorization.
2731703742651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386981886.
The product of its (nonzero) digits is 1481760, while the sum is 48.
The spelling of 2731703742651 in words is "two trillion, seven hundred thirty-one billion, seven hundred three million, seven hundred forty-two thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •