Base | Representation |
---|---|
bin | 11001111110001000111010… |
… | …01101011110010011000110 |
3 | 21111012201121210122012220012 |
4 | 30333010131031132103012 |
5 | 24441200123033044100 |
6 | 321244140225310222 |
7 | 15013052435053511 |
oct | 1477043515362306 |
9 | 244181553565805 |
10 | 57110670206150 |
11 | 17219554506320 |
12 | 64a451ba95372 |
13 | 25b3689355692 |
14 | 1016257a43d78 |
15 | 6908a61e1135 |
hex | 33f11d35e4c6 |
57110670206150 has 96 divisors (see below), whose sum is σ = 116187873500160. Its totient is φ = 20712875216000.
The previous prime is 57110670206147. The next prime is 57110670206171. The reversal of 57110670206150 is 5160207601175.
It is a junction number, because it is equal to n+sod(n) for n = 57110670206098 and 57110670206107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 559533821 + ... + 559635879.
It is an arithmetic number, because the mean of its divisors is an integer number (1210290348960).
Almost surely, 257110670206150 is an apocalyptic number.
57110670206150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
57110670206150 is an abundant number, since it is smaller than the sum of its proper divisors (59077203294010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57110670206150 is a wasteful number, since it uses less digits than its factorization.
57110670206150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104750 (or 104745 counting only the distinct ones).
The product of its (nonzero) digits is 88200, while the sum is 41.
The spelling of 57110670206150 in words is "fifty-seven trillion, one hundred ten billion, six hundred seventy million, two hundred six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •