Base | Representation |
---|---|
bin | 101100000111001111101… |
… | …111100011010101001001 |
3 | 101201210200002002012222121 |
4 | 230013033233203111021 |
5 | 344131340421332443 |
6 | 10240342325451241 |
7 | 432004561560133 |
oct | 54071757432511 |
9 | 11653602065877 |
10 | 3031437292873 |
11 | a69697360160 |
12 | 40b61a270b21 |
13 | 18cb2b900052 |
14 | a6a181a0053 |
15 | 53cc462c4ed |
hex | 2c1cfbe3549 |
3031437292873 has 16 divisors (see below), whose sum is σ = 3348015318144. Its totient is φ = 2721901628160.
The previous prime is 3031437292823. The next prime is 3031437292883. The reversal of 3031437292873 is 3782927341303.
It is not a de Polignac number, because 3031437292873 - 229 = 3030900421961 is a prime.
It is a super-2 number, since 2×30314372928732 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3031437292873.
It is not an unprimeable number, because it can be changed into a prime (3031437292823) 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 15 ways as a sum of consecutive naturals, for example, 4967040 + ... + 5543857.
It is an arithmetic number, because the mean of its divisors is an integer number (209250957384).
Almost surely, 23031437292873 is an apocalyptic number.
It is an amenable number.
3031437292873 is a deficient number, since it is larger than the sum of its proper divisors (316578025271).
3031437292873 is a wasteful number, since it uses less digits than its factorization.
3031437292873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10511232.
The product of its (nonzero) digits is 4572288, while the sum is 52.
The spelling of 3031437292873 in words is "three trillion, thirty-one billion, four hundred thirty-seven million, two hundred ninety-two thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •