Base | Representation |
---|---|
bin | 11101100001001100110… |
… | …000111110111010100001 |
3 | 21011220221112002112112212 |
4 | 131201030300332322201 |
5 | 231213343143111422 |
6 | 4151515154131505 |
7 | 266361300344522 |
oct | 35411460767241 |
9 | 7156845075485 |
10 | 2028512472737 |
11 | 712318453643 |
12 | 289180880b95 |
13 | 1193986b340a |
14 | 70275520849 |
15 | 37b762229e2 |
hex | 1d84cc3eea1 |
2028512472737 has 8 divisors (see below), whose sum is σ = 2036496243336. Its totient is φ = 2020529405952.
The previous prime is 2028512472731. The next prime is 2028512472761. The reversal of 2028512472737 is 7372742158202.
It can be written as a sum of positive squares in 4 ways, for example, as 500522290576 + 1527990182161 = 707476^2 + 1236119^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2028512472737 - 26 = 2028512472673 is a prime.
It is a super-2 number, since 2×20285124727372 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2028512472731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6029153 + ... + 6356705.
It is an arithmetic number, because the mean of its divisors is an integer number (254562030417).
Almost surely, 22028512472737 is an apocalyptic number.
It is an amenable number.
2028512472737 is a deficient number, since it is larger than the sum of its proper divisors (7983770599).
2028512472737 is a wasteful number, since it uses less digits than its factorization.
2028512472737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351907.
The product of its (nonzero) digits is 2634240, while the sum is 50.
The spelling of 2028512472737 in words is "two trillion, twenty-eight billion, five hundred twelve million, four hundred seventy-two thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •