Base | Representation |
---|---|
bin | 10011101010001011110… |
… | …00010111000110010010 |
3 | 2101120112112001120022122 |
4 | 21311011320113012102 |
5 | 42031341430034200 |
6 | 1234151241134242 |
7 | 66542036354312 |
oct | 11650570270622 |
9 | 2346475046278 |
10 | 675482268050 |
11 | 24051a148807 |
12 | aaab578a382 |
13 | 4b90bb1a845 |
14 | 2499d019442 |
15 | 128868e9385 |
hex | 9d45e17192 |
675482268050 has 54 divisors (see below), whose sum is σ = 1284216927903. Its totient is φ = 264337189440.
The previous prime is 675482268047. The next prime is 675482268053. The reversal of 675482268050 is 50862284576.
It is an interprime number because it is at equal distance from previous prime (675482268047) and next prime (675482268053).
It can be written as a sum of positive squares in 5 ways, for example, as 414425650081 + 261056617969 = 643759^2 + 510937^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=581155.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 675482267983 and 675482268001.
It is not an unprimeable number, because it can be changed into a prime (675482268053) by changing a digit.
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 26 ways as a sum of consecutive naturals, for example, 273141614 + ... + 273144086.
Almost surely, 2675482268050 is an apocalyptic number.
675482268050 is a deficient number, since it is larger than the sum of its proper divisors (608734659853).
675482268050 is an frugal number, since it uses more digits than its factorization.
675482268050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5052 (or 2527 counting only the distinct ones).
The product of its (nonzero) digits is 6451200, while the sum is 53.
The spelling of 675482268050 in words is "six hundred seventy-five billion, four hundred eighty-two million, two hundred sixty-eight thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •