Base | Representation |
---|---|
bin | 10010110010000110000100… |
… | …00010101011111000010111 |
3 | 12102020120222011002122112001 |
4 | 21121003002002223320113 |
5 | 20403204344204033023 |
6 | 223502350115540131 |
7 | 11462043136530202 |
oct | 1131030202537027 |
9 | 172216864078461 |
10 | 41303661002263 |
11 | 12184869940470 |
12 | 4770b145ba647 |
13 | 1a07bc2cb021a |
14 | a2b171d72939 |
15 | 4b960a2536ad |
hex | 2590c20abe17 |
41303661002263 has 8 divisors (see below), whose sum is σ = 45058876102800. Its totient is φ = 37548502039680.
The previous prime is 41303661002231. The next prime is 41303661002267. The reversal of 41303661002263 is 36220016630314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41303661002263 - 25 = 41303661002231 is a prime.
It is a super-2 number, since 2×413036610022632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41303661002267) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12488688 + ... + 15445861.
It is an arithmetic number, because the mean of its divisors is an integer number (5632359512850).
Almost surely, 241303661002263 is an apocalyptic number.
41303661002263 is a deficient number, since it is larger than the sum of its proper divisors (3755215100537).
41303661002263 is a wasteful number, since it uses less digits than its factorization.
41303661002263 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28068977.
The product of its (nonzero) digits is 93312, while the sum is 37.
Adding to 41303661002263 its reverse (36220016630314), we get a palindrome (77523677632577).
The spelling of 41303661002263 in words is "forty-one trillion, three hundred three billion, six hundred sixty-one million, two thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •