Base | Representation |
---|---|
bin | 10011101010000110110… |
… | …11001000011110100101 |
3 | 2101120102122111112220212 |
4 | 21311003123020132211 |
5 | 42031300402122212 |
6 | 1234143205505205 |
7 | 66541026131516 |
oct | 11650333103645 |
9 | 2346378445825 |
10 | 675441051557 |
11 | 2404a8957198 |
12 | aaaa3a12205 |
13 | 4b90341939c |
14 | 2499776aa0d |
15 | 12882ea6e22 |
hex | 9d436c87a5 |
675441051557 has 8 divisors (see below), whose sum is σ = 676865478912. Its totient is φ = 674016778800.
The previous prime is 675441051539. The next prime is 675441051563. The reversal of 675441051557 is 755150144576.
675441051557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 675441051557 - 28 = 675441051301 is a prime.
It is a super-2 number, since 2×6754410515572 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (675441051587) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14109332 + ... + 14157122.
It is an arithmetic number, because the mean of its divisors is an integer number (84608184864).
Almost surely, 2675441051557 is an apocalyptic number.
It is an amenable number.
675441051557 is a deficient number, since it is larger than the sum of its proper divisors (1424427355).
675441051557 is a wasteful number, since it uses less digits than its factorization.
675441051557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77299.
The product of its (nonzero) digits is 2940000, while the sum is 50.
The spelling of 675441051557 in words is "six hundred seventy-five billion, four hundred forty-one million, fifty-one thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •