Base | Representation |
---|---|
bin | 11001111100100111011101… |
… | …01100010010111011100110 |
3 | 21111000201120112012221122201 |
4 | 30332103232230102323212 |
5 | 24434321000114234400 |
6 | 321204124425045114 |
7 | 15006221051652664 |
oct | 1476235654227346 |
9 | 244021515187581 |
10 | 57058350149350 |
11 | 171a9346173260 |
12 | 649635a02679a |
13 | 25ab76ba3a5a4 |
14 | 10138d3143c34 |
15 | 68e342d1706a |
hex | 33e4eeb12ee6 |
57058350149350 has 48 divisors (see below), whose sum is σ = 115885701005616. Its totient is φ = 20728935152000.
The previous prime is 57058350149341. The next prime is 57058350149473. The reversal of 57058350149350 is 5394105385075.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a junction number, because it is equal to n+sod(n) for n = 57058350149291 and 57058350149300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48305449 + ... + 49472548.
It is an arithmetic number, because the mean of its divisors is an integer number (2414285437617).
Almost surely, 257058350149350 is an apocalyptic number.
57058350149350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
57058350149350 is an abundant number, since it is smaller than the sum of its proper divisors (58827350856266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57058350149350 is a wasteful number, since it uses less digits than its factorization.
57058350149350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97779081 (or 97779076 counting only the distinct ones).
The product of its (nonzero) digits is 11340000, while the sum is 55.
The spelling of 57058350149350 in words is "fifty-seven trillion, fifty-eight billion, three hundred fifty million, one hundred forty-nine thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •