Base | Representation |
---|---|
bin | 10010011010011101000010… |
… | …10001011111100111010100 |
3 | 12022100221021200000001100112 |
4 | 21031032201101133213110 |
5 | 20301402302234321413 |
6 | 222041250342102152 |
7 | 11346255464503601 |
oct | 1115164121374724 |
9 | 168327250001315 |
10 | 40491362417108 |
11 | 119a1321527709 |
12 | 465b5b741a958 |
13 | 197941c078235 |
14 | 9ddb144a76a8 |
15 | 4a34173b12a8 |
hex | 24d3a145f9d4 |
40491362417108 has 24 divisors (see below), whose sum is σ = 73369427329800. Its totient is φ = 19529927919488.
The previous prime is 40491362417089. The next prime is 40491362417119. The reversal of 40491362417108 is 80171426319404.
40491362417108 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 122900727184 + 40368461689924 = 350572^2 + 6353618^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 157248935 + ... + 157506222.
It is an arithmetic number, because the mean of its divisors is an integer number (3057059472075).
Almost surely, 240491362417108 is an apocalyptic number.
It is an amenable number.
40491362417108 is a deficient number, since it is larger than the sum of its proper divisors (32878064912692).
40491362417108 is a wasteful number, since it uses less digits than its factorization.
40491362417108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314756299 (or 314756297 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 50.
The spelling of 40491362417108 in words is "forty trillion, four hundred ninety-one billion, three hundred sixty-two million, four hundred seventeen thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •