Base | Representation |
---|---|
bin | 10010100001001001011100… |
… | …01011111001111100100001 |
3 | 12100011220221120122222210021 |
4 | 21100210232023321330201 |
5 | 20314134321102244431 |
6 | 222335045012233441 |
7 | 11402010154163602 |
oct | 1120445613717441 |
9 | 170156846588707 |
10 | 40721359806241 |
11 | 11a7a9170092a4 |
12 | 46980a500b881 |
13 | 1995014056cba |
14 | a0acd2513da9 |
15 | 4a93c90e5b11 |
hex | 25092e2f9f21 |
40721359806241 has 9 divisors (see below), whose sum is σ = 41690672553009. Its totient is φ = 39774083422836.
The previous prime is 40721359806229. The next prime is 40721359806247. The reversal of 40721359806241 is 14260895312704.
The square root of 40721359806241 is 6381329.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 40721359806241 - 217 = 40721359675169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40721359806247) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 274322946 + ... + 274471348.
It is a 1-persistent number, because it is pandigital, but 2⋅40721359806241 = 81442719612482 is not.
Almost surely, 240721359806241 is an apocalyptic number.
40721359806241 is the 6381329-th square number.
40721359806241 is the 3190665-th centered octagonal number.
It is an amenable number.
40721359806241 is a deficient number, since it is larger than the sum of its proper divisors (969312746768).
40721359806241 is an frugal number, since it uses more digits than its factorization.
40721359806241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296892 (or 148446 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 52.
The spelling of 40721359806241 in words is "forty trillion, seven hundred twenty-one billion, three hundred fifty-nine million, eight hundred six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •