Base | Representation |
---|---|
bin | 10000001101100110111… |
… | …00111111000001010100 |
3 | 1222020212120111022011220 |
4 | 20012303130333001110 |
5 | 33111330221013022 |
6 | 1103524401130340 |
7 | 55150334426532 |
oct | 10066334770124 |
9 | 1866776438156 |
10 | 557061501012 |
11 | 1a52807707a5 |
12 | 8bb669299b0 |
13 | 406b8b77963 |
14 | 1cd6771d152 |
15 | e7553de85c |
hex | 81b373f054 |
557061501012 has 12 divisors (see below), whose sum is σ = 1299810169056. Its totient is φ = 185687167000.
The previous prime is 557061500981. The next prime is 557061501041. The reversal of 557061501012 is 210105160755.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-3 number, since 3×5570615010123 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23210895864 + ... + 23210895887.
It is an arithmetic number, because the mean of its divisors is an integer number (108317514088).
Almost surely, 2557061501012 is an apocalyptic number.
It is an amenable number.
557061501012 is an abundant number, since it is smaller than the sum of its proper divisors (742748668044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
557061501012 is a wasteful number, since it uses less digits than its factorization.
557061501012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46421791758 (or 46421791756 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 33.
Adding to 557061501012 its reverse (210105160755), we get a palindrome (767166661767).
The spelling of 557061501012 in words is "five hundred fifty-seven billion, sixty-one million, five hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •