Base | Representation |
---|---|
bin | 101010000001101110101… |
… | …001000000101100000001 |
3 | 101020002121212020221120011 |
4 | 222001232221000230001 |
5 | 334304234003024033 |
6 | 10050432450344521 |
7 | 415441113140620 |
oct | 52015651005401 |
9 | 11202555227504 |
10 | 2888074267393 |
11 | a139096a5217 |
12 | 3a788a28b141 |
13 | 17c46238c963 |
14 | 9dad806b6b7 |
15 | 501d3558ccd |
hex | 2a06ea40b01 |
2888074267393 has 8 divisors (see below), whose sum is σ = 3317410907712. Its totient is φ = 2462926277616.
The previous prime is 2888074267369. The next prime is 2888074267399. The reversal of 2888074267393 is 3937624708882.
2888074267393 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2888074267393 - 229 = 2887537396481 is a prime.
It is a super-2 number, since 2×28880742673932 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2888074267399) 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, 1047161155 + ... + 1047163912.
It is an arithmetic number, because the mean of its divisors is an integer number (414676363464).
Almost surely, 22888074267393 is an apocalyptic number.
It is an amenable number.
2888074267393 is a deficient number, since it is larger than the sum of its proper divisors (429336640319).
2888074267393 is a wasteful number, since it uses less digits than its factorization.
2888074267393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2094325271.
The product of its (nonzero) digits is 195084288, while the sum is 67.
The spelling of 2888074267393 in words is "two trillion, eight hundred eighty-eight billion, seventy-four million, two hundred sixty-seven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •