Base | Representation |
---|---|
bin | 10010100000101100101110… |
… | …01101110111110010101000 |
3 | 12100010110011002110100021010 |
4 | 21100112113031313302220 |
5 | 20313411232131411300 |
6 | 222324015052343520 |
7 | 11400623122411644 |
oct | 1120262715676250 |
9 | 170113132410233 |
10 | 40705942060200 |
11 | 11a7432510051a |
12 | 4695101774ba0 |
13 | 1993727ac5151 |
14 | a0a26ca29c24 |
15 | 4a8cc57b4a50 |
hex | 250597377ca8 |
40705942060200 has 48 divisors (see below), whose sum is σ = 126188420388480. Its totient is φ = 10854917882560.
The previous prime is 40705942060193. The next prime is 40705942060229. The reversal of 40705942060200 is 206024950704.
40705942060200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11 ways as a sum of consecutive naturals, for example, 33921617784 + ... + 33921618983.
It is an arithmetic number, because the mean of its divisors is an integer number (2628925424760).
Almost surely, 240705942060200 is an apocalyptic number.
40705942060200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40705942060200 is an abundant number, since it is smaller than the sum of its proper divisors (85482478328280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40705942060200 is a wasteful number, since it uses less digits than its factorization.
40705942060200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67843236786 (or 67843236777 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 39.
The spelling of 40705942060200 in words is "forty trillion, seven hundred five billion, nine hundred forty-two million, sixty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •