Base | Representation |
---|---|
bin | 101001110011110111111… |
… | …0100011011110101011001 |
3 | 202100100110010120021122102 |
4 | 1103213233310123311121 |
5 | 1223122104030243443 |
6 | 20115505102533145 |
7 | 1132110006445034 |
oct | 123475764336531 |
9 | 22310403507572 |
10 | 5746394774873 |
11 | 191603a051205 |
12 | 789833b971b5 |
13 | 328b623b16cc |
14 | 15c1ac66c01b |
15 | 9e7248c8cb8 |
hex | 539efd1bd59 |
5746394774873 has 8 divisors (see below), whose sum is σ = 5931901516800. Its totient is φ = 5560896731040.
The previous prime is 5746394774843. The next prime is 5746394774881. The reversal of 5746394774873 is 3784774936475.
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 5746394774873 - 210 = 5746394773849 is a prime.
It is a super-2 number, since 2×57463947748732 (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 5746394774873.
It is not an unprimeable number, because it can be changed into a prime (5746394774803) 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, 818465 + ... + 3487502.
It is an arithmetic number, because the mean of its divisors is an integer number (741487689600).
Almost surely, 25746394774873 is an apocalyptic number.
It is an amenable number.
5746394774873 is a deficient number, since it is larger than the sum of its proper divisors (185506741927).
5746394774873 is a wasteful number, since it uses less digits than its factorization.
5746394774873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4349047.
The product of its digits is 2987228160, while the sum is 74.
The spelling of 5746394774873 in words is "five trillion, seven hundred forty-six billion, three hundred ninety-four million, seven hundred seventy-four thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •