Base | Representation |
---|---|
bin | 10010111011010100100000… |
… | …01100011100011101100001 |
3 | 12110100220011211010000000000 |
4 | 21131222100030130131201 |
5 | 20423403043440422044 |
6 | 224304132543050213 |
7 | 11523664364114442 |
oct | 1135522014343541 |
9 | 173326154100000 |
10 | 41620652279649 |
11 | 12297246188973 |
12 | 48024402a0969 |
13 | 1a2ba70069c01 |
14 | a3c6439632c9 |
15 | 4c29ae464d69 |
hex | 25da9031c761 |
41620652279649 has 99 divisors (see below), whose sum is σ = 63213952497969. Its totient is φ = 27403254429480.
The previous prime is 41620652279617. The next prime is 41620652279651. The reversal of 41620652279649 is 94697225602614.
The square root of 41620652279649 is 6451407.
It is a perfect power (a square), and thus also a powerful number.
41620652279649 is a `hidden beast` number, since 4 + 1 + 62 + 0 + 6 + 522 + 7 + 9 + 6 + 49 = 666.
It is not a de Polignac number, because 41620652279649 - 25 = 41620652279617 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41620652279669) by changing a digit.
It is a polite number, since it can be written in 98 ways as a sum of consecutive naturals, for example, 217909174144 + ... + 217909174334.
Almost surely, 241620652279649 is an apocalyptic number.
41620652279649 is the 6451407-th square number.
41620652279649 is the 3225704-th centered octagonal number.
It is an amenable number.
41620652279649 is a deficient number, since it is larger than the sum of its proper divisors (21593300218320).
41620652279649 is an frugal number, since it uses more digits than its factorization.
41620652279649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690 (or 333 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 63.
The spelling of 41620652279649 in words is "forty-one trillion, six hundred twenty billion, six hundred fifty-two million, two hundred seventy-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •