Base | Representation |
---|---|
bin | 111101101111101010000… |
… | …100011100100000110010 |
3 | 120000122002010111120210110 |
4 | 331233222010130200302 |
5 | 1024004241244130213 |
6 | 13005122412042150 |
7 | 615356655560445 |
oct | 75575204344062 |
9 | 16018063446713 |
10 | 4243059755058 |
11 | 13965206850a3 |
12 | 586400163356 |
13 | 24a171073cc7 |
14 | 10951810b65c |
15 | 755898605c3 |
hex | 3dbea11c832 |
4243059755058 has 8 divisors (see below), whose sum is σ = 8486119510128. Its totient is φ = 1414353251684.
The previous prime is 4243059755057. The next prime is 4243059755147. The reversal of 4243059755058 is 8505579503424.
4243059755058 is digitally balanced in base 2, 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.
4243059755058 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 4243059754989 and 4243059755007.
It is not an unprimeable number, because it can be changed into a prime (4243059755057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 353588312916 + ... + 353588312927.
It is an arithmetic number, because the mean of its divisors is an integer number (1060764938766).
Almost surely, 24243059755058 is an apocalyptic number.
4243059755058 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4243059755058 is a wasteful number, since it uses less digits than its factorization.
4243059755058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707176625848.
The product of its (nonzero) digits is 30240000, while the sum is 57.
The spelling of 4243059755058 in words is "four trillion, two hundred forty-three billion, fifty-nine million, seven hundred fifty-five thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •