Base | Representation |
---|---|
bin | 111101101000011110111101… |
… | …1010010111010101111011010 |
3 | 2122002111201020221011200122210 |
4 | 1323100331323102322233122 |
5 | 1032024141441220403040 |
6 | 5201001041542055550 |
7 | 222122201601244122 |
oct | 17320757322725732 |
9 | 2562451227150583 |
10 | 542125725559770 |
11 | 147813257987620 |
12 | 5097772071a5b6 |
13 | 1a36630c956a61 |
14 | 97c304ccdbc82 |
15 | 42a1e03075480 |
hex | 1ed0f7b4babda |
542125725559770 has 64 divisors (see below), whose sum is σ = 1481096053407744. Its totient is φ = 125710313171520.
The previous prime is 542125725559751. The next prime is 542125725559777. The reversal of 542125725559770 is 77955527521245.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (542125725559777) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35713149562 + ... + 35713164741.
It is an arithmetic number, because the mean of its divisors is an integer number (23142125834496).
Almost surely, 2542125725559770 is an apocalyptic number.
542125725559770 is an abundant number, since it is smaller than the sum of its proper divisors (938970327847974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
542125725559770 is a wasteful number, since it uses less digits than its factorization.
542125725559770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71426314347.
The product of its (nonzero) digits is 308700000, while the sum is 66.
The spelling of 542125725559770 in words is "five hundred forty-two trillion, one hundred twenty-five billion, seven hundred twenty-five million, five hundred fifty-nine thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •