Base | Representation |
---|---|
bin | 11010001000011100100111… |
… | …01001011001001011000110 |
3 | 21112110120210211011022022021 |
4 | 31010032103221121023012 |
5 | 30013001000201224300 |
6 | 322114552442553354 |
7 | 15050461263256060 |
oct | 1504162351311306 |
9 | 245416724138267 |
10 | 57464844554950 |
11 | 17345781711708 |
12 | 65410a420885a |
13 | 260abb09bb281 |
14 | 1029455a52730 |
15 | 699bd4958d1a |
hex | 344393a592c6 |
57464844554950 has 24 divisors (see below), whose sum is σ = 122153840997552. Its totient is φ = 19702232418720.
The previous prime is 57464844554921. The next prime is 57464844554977. The reversal of 57464844554950 is 5945544846475.
It is a Harshad number since it is a multiple of its sum of digits (70).
It is a self number, because there is not a number n which added to its sum of digits gives 57464844554950.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82092634729 + ... + 82092635428.
It is an arithmetic number, because the mean of its divisors is an integer number (5089743374898).
Almost surely, 257464844554950 is an apocalyptic number.
57464844554950 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
57464844554950 is an abundant number, since it is smaller than the sum of its proper divisors (64688996442602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57464844554950 is a wasteful number, since it uses less digits than its factorization.
57464844554950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164185270176 (or 164185270171 counting only the distinct ones).
The product of its (nonzero) digits is 1935360000, while the sum is 70.
The spelling of 57464844554950 in words is "fifty-seven trillion, four hundred sixty-four billion, eight hundred forty-four million, five hundred fifty-four thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •