Base | Representation |
---|---|
bin | 100001111010101111101… |
… | …1010001000100000001101 |
3 | 121111122111201110110200012 |
4 | 1003311133122020200031 |
5 | 1102334014342433003 |
6 | 13525310011443005 |
7 | 660535534635446 |
oct | 103653732104015 |
9 | 17448451413605 |
10 | 4661640202253 |
11 | 1537a99402481 |
12 | 633559a56465 |
13 | 27a78ac537a8 |
14 | 1218a5c342cd |
15 | 813d756b8d8 |
hex | 43d5f68880d |
4661640202253 has 2 divisors, whose sum is σ = 4661640202254. Its totient is φ = 4661640202252.
The previous prime is 4661640202217. The next prime is 4661640202267. The reversal of 4661640202253 is 3522020461664.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4521993744004 + 139646458249 = 2126498^2 + 373693^2 .
It is a cyclic number.
It is not a de Polignac number, because 4661640202253 - 212 = 4661640198157 is a prime.
It is a super-2 number, since 2×46616402022532 (a number of 26 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 4661640202253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4661610202253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2330820101126 + 2330820101127.
It is an arithmetic number, because the mean of its divisors is an integer number (2330820101127).
Almost surely, 24661640202253 is an apocalyptic number.
It is an amenable number.
4661640202253 is a deficient number, since it is larger than the sum of its proper divisors (1).
4661640202253 is an equidigital number, since it uses as much as digits as its factorization.
4661640202253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 414720, while the sum is 41.
The spelling of 4661640202253 in words is "four trillion, six hundred sixty-one billion, six hundred forty million, two hundred two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •