Base | Representation |
---|---|
bin | 100100101110111… |
… | …000100100010001 |
3 | 1120221121202122102 |
4 | 210232320210101 |
5 | 2230231120342 |
6 | 141052450145 |
7 | 21162131552 |
oct | 4456704421 |
9 | 1527552572 |
10 | 616270097 |
11 | 296960933 |
12 | 152479955 |
13 | 9a8a4381 |
14 | 5bbc0329 |
15 | 39183832 |
hex | 24bb8911 |
616270097 has 4 divisors (see below), whose sum is σ = 637520820. Its totient is φ = 595019376.
The previous prime is 616270079. The next prime is 616270117. The reversal of 616270097 is 790072616.
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 515789521 + 100480576 = 22711^2 + 10024^2 .
It is a cyclic number.
It is not a de Polignac number, because 616270097 - 220 = 615221521 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 616270097.
It is not an unprimeable number, because it can be changed into a prime (616270597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10625318 + ... + 10625375.
It is an arithmetic number, because the mean of its divisors is an integer number (159380205).
Almost surely, 2616270097 is an apocalyptic number.
It is an amenable number.
616270097 is a deficient number, since it is larger than the sum of its proper divisors (21250723).
616270097 is a wasteful number, since it uses less digits than its factorization.
616270097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21250722.
The product of its (nonzero) digits is 31752, while the sum is 38.
The square root of 616270097 is about 24824.7879547842. The cubic root of 616270097 is about 850.9885140834.
The spelling of 616270097 in words is "six hundred sixteen million, two hundred seventy thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •