Base | Representation |
---|---|
bin | 100101000011000… |
… | …001101010100001 |
3 | 1121022120000122022 |
4 | 211003001222201 |
5 | 2233104101431 |
6 | 141401551225 |
7 | 21255042554 |
oct | 4503015241 |
9 | 1538500568 |
10 | 621550241 |
11 | 299937994 |
12 | 1541a5515 |
13 | 9ba02810 |
14 | 5c79669b |
15 | 3987807b |
hex | 250c1aa1 |
621550241 has 4 divisors (see below), whose sum is σ = 669361812. Its totient is φ = 573738672.
The previous prime is 621550219. The next prime is 621550247. The reversal of 621550241 is 142055126.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 127599616 + 493950625 = 11296^2 + 22225^2 .
It is not a de Polignac number, because 621550241 - 26 = 621550177 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 621550241.
It is not an unprimeable number, because it can be changed into a prime (621550247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23905766 + ... + 23905791.
It is an arithmetic number, because the mean of its divisors is an integer number (167340453).
Almost surely, 2621550241 is an apocalyptic number.
It is an amenable number.
621550241 is a deficient number, since it is larger than the sum of its proper divisors (47811571).
621550241 is a wasteful number, since it uses less digits than its factorization.
621550241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47811570.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 621550241 is about 24930.9093496407. The cubic root of 621550241 is about 853.4120022111.
The spelling of 621550241 in words is "six hundred twenty-one million, five hundred fifty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •