Base | Representation |
---|---|
bin | 10010011101101101011100… |
… | …00111110111110110111001 |
3 | 12022202122002002212022002222 |
4 | 21032312232013313312321 |
5 | 20310220422232222343 |
6 | 222204512500133425 |
7 | 11360326213151642 |
oct | 1116665607676671 |
9 | 168678062768088 |
10 | 40603247148473 |
11 | 11a34816544349 |
12 | 4679221397275 |
13 | 1986b3cb90ca9 |
14 | a052c9adc6c9 |
15 | 4a62b4b9ca68 |
hex | 24edae1f7db9 |
40603247148473 has 16 divisors (see below), whose sum is σ = 42277262689680. Its totient is φ = 38947567067136.
The previous prime is 40603247148461. The next prime is 40603247148493. The reversal of 40603247148473 is 37484174230604.
It can be written as a sum of positive squares in 8 ways, for example, as 1920893584 + 40601326254889 = 43828^2 + 6371917^2 .
It is a cyclic number.
It is not a de Polignac number, because 40603247148473 - 212 = 40603247144377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40603247148493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29713961 + ... + 31050377.
It is an arithmetic number, because the mean of its divisors is an integer number (2642328918105).
Almost surely, 240603247148473 is an apocalyptic number.
It is an amenable number.
40603247148473 is a deficient number, since it is larger than the sum of its proper divisors (1674015541207).
40603247148473 is a wasteful number, since it uses less digits than its factorization.
40603247148473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343276.
The product of its (nonzero) digits is 10838016, while the sum is 53.
The spelling of 40603247148473 in words is "forty trillion, six hundred three billion, two hundred forty-seven million, one hundred forty-eight thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •