Base | Representation |
---|---|
bin | 100100100011001… |
… | …111111100101101 |
3 | 1120201212210220002 |
4 | 210203033330231 |
5 | 2223441021031 |
6 | 140503234045 |
7 | 21124166552 |
oct | 4443177455 |
9 | 1521783802 |
10 | 613220141 |
11 | 295168406 |
12 | 151448925 |
13 | 9a077071 |
14 | 5b628a29 |
15 | 38c7eccb |
hex | 248cff2d |
613220141 has 6 divisors (see below), whose sum is σ = 651414090. Its totient is φ = 577148096.
The previous prime is 613220137. The next prime is 613220189. The reversal of 613220141 is 141022316.
It can be written as a sum of positive squares in 3 ways, for example, as 211818916 + 401401225 = 14554^2 + 20035^2 .
It is not a de Polignac number, because 613220141 - 22 = 613220137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (613220131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1060646 + ... + 1061223.
It is an arithmetic number, because the mean of its divisors is an integer number (108569015).
Almost surely, 2613220141 is an apocalyptic number.
It is an amenable number.
613220141 is a deficient number, since it is larger than the sum of its proper divisors (38193949).
613220141 is a wasteful number, since it uses less digits than its factorization.
613220141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2121903 (or 2121886 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 613220141 is about 24763.2821128380. The cubic root of 613220141 is about 849.5823281319.
Adding to 613220141 its reverse (141022316), we get a palindrome (754242457).
The spelling of 613220141 in words is "six hundred thirteen million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •