Base | Representation |
---|---|
bin | 100111011110111000111… |
… | …010010101000100001001 |
3 | 100121101022102122022012001 |
4 | 213132320322111010021 |
5 | 323423142011142103 |
6 | 5434234503351001 |
7 | 400011200050600 |
oct | 47367072250411 |
9 | 10541272568161 |
10 | 2713226662153 |
11 | 956744798527 |
12 | 379a12152461 |
13 | 168b19033c07 |
14 | 9546c682a37 |
15 | 4a89d35b01d |
hex | 277b8e95109 |
2713226662153 has 6 divisors (see below), whose sum is σ = 3156202443786. Its totient is φ = 2325622853232.
The previous prime is 2713226662109. The next prime is 2713226662163. The reversal of 2713226662153 is 3512666223172.
2713226662153 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2682562449609 + 30664212544 = 1637853^2 + 175112^2 .
It is not a de Polignac number, because 2713226662153 - 241 = 514203406601 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2713226662163) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 27685986300 + ... + 27685986397.
It is an arithmetic number, because the mean of its divisors is an integer number (526033740631).
Almost surely, 22713226662153 is an apocalyptic number.
It is an amenable number.
2713226662153 is a deficient number, since it is larger than the sum of its proper divisors (442975781633).
2713226662153 is an equidigital number, since it uses as much as digits as its factorization.
2713226662153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55371972711 (or 55371972704 counting only the distinct ones).
The product of its digits is 1088640, while the sum is 46.
The spelling of 2713226662153 in words is "two trillion, seven hundred thirteen billion, two hundred twenty-six million, six hundred sixty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •