Base | Representation |
---|---|
bin | 100101111010001000… |
… | …100011000011110110 |
3 | 10220001201022121000120 |
4 | 211322020203003312 |
5 | 1131330131014044 |
6 | 30410554552410 |
7 | 2640451210656 |
oct | 457210430366 |
9 | 126051277016 |
10 | 40703766774 |
11 | 16298240480 |
12 | 7a7b738706 |
13 | 3ab8b102c8 |
14 | 1d81c46366 |
15 | 10d36a0519 |
hex | 97a2230f6 |
40703766774 has 64 divisors (see below), whose sum is σ = 94436409600. Its totient is φ = 11559019520.
The previous prime is 40703766773. The next prime is 40703766799. The reversal of 40703766774 is 47766730704.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40703766773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 183577 + ... + 339275.
It is an arithmetic number, because the mean of its divisors is an integer number (1475568900).
Almost surely, 240703766774 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40703766774, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47218204800).
40703766774 is an abundant number, since it is smaller than the sum of its proper divisors (53732642826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40703766774 is a wasteful number, since it uses less digits than its factorization.
40703766774 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155965.
The product of its (nonzero) digits is 4148928, while the sum is 51.
The spelling of 40703766774 in words is "forty billion, seven hundred three million, seven hundred sixty-six thousand, seven hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •