Base | Representation |
---|---|
bin | 10010010010101011000… |
… | …11110111011111111101 |
3 | 2020002021021221011111012 |
4 | 21021111203313133331 |
5 | 40244132134102231 |
6 | 1200421303005005 |
7 | 63256555504304 |
oct | 11112543673775 |
9 | 2202237834435 |
10 | 628500690941 |
11 | 222600289532 |
12 | a1983739765 |
13 | 47362512986 |
14 | 225c352943b |
15 | 11537036e2b |
hex | 92558f77fd |
628500690941 has 4 divisors (see below), whose sum is σ = 628502517372. Its totient is φ = 628498864512.
The previous prime is 628500690887. The next prime is 628500690973. The reversal of 628500690941 is 149096005826.
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 365789088025 + 262711602916 = 604805^2 + 512554^2 .
It is a cyclic number.
It is not a de Polignac number, because 628500690941 - 26 = 628500690877 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 628500690941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (628500690991) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 223310 + ... + 1143183.
It is an arithmetic number, because the mean of its divisors is an integer number (157125629343).
Almost surely, 2628500690941 is an apocalyptic number.
It is an amenable number.
628500690941 is a deficient number, since it is larger than the sum of its proper divisors (1826431).
628500690941 is a wasteful number, since it uses less digits than its factorization.
628500690941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1826430.
The product of its (nonzero) digits is 933120, while the sum is 50.
The spelling of 628500690941 in words is "six hundred twenty-eight billion, five hundred million, six hundred ninety thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •