Base | Representation |
---|---|
bin | 10001110110010000010… |
… | …01100011001001010001 |
3 | 2011121212222110112012201 |
4 | 20323020021203021101 |
5 | 40021410241134411 |
6 | 1145415312123201 |
7 | 62206512031225 |
oct | 10731011431121 |
9 | 2147788415181 |
10 | 613243302481 |
11 | 217090947787 |
12 | 9aa25b36501 |
13 | 45aa0568274 |
14 | 21977064785 |
15 | 10e4282e3c1 |
hex | 8ec8263251 |
613243302481 has 2 divisors, whose sum is σ = 613243302482. Its totient is φ = 613243302480.
The previous prime is 613243302439. The next prime is 613243302517. The reversal of 613243302481 is 184203342316.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 463238139456 + 150005163025 = 680616^2 + 387305^2 .
It is a cyclic number.
It is not a de Polignac number, because 613243302481 - 213 = 613243294289 is a prime.
It is a super-2 number, since 2×6132433024812 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 613243302481.
It is not a weakly prime, because it can be changed into another prime (613243302421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 306621651240 + 306621651241.
It is an arithmetic number, because the mean of its divisors is an integer number (306621651241).
Almost surely, 2613243302481 is an apocalyptic number.
It is an amenable number.
613243302481 is a deficient number, since it is larger than the sum of its proper divisors (1).
613243302481 is an equidigital number, since it uses as much as digits as its factorization.
613243302481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 37.
Adding to 613243302481 its reverse (184203342316), we get a palindrome (797446644797).
The spelling of 613243302481 in words is "six hundred thirteen billion, two hundred forty-three million, three hundred two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •