Base | Representation |
---|---|
bin | 10010101000100010000000… |
… | …00000011010001110101100 |
3 | 12101002011210111211022111011 |
4 | 21110101000000122032230 |
5 | 20332313411313244400 |
6 | 223051403351435004 |
7 | 11426231142044104 |
oct | 1124210000321654 |
9 | 171064714738434 |
10 | 40975061853100 |
11 | 12068476220101 |
12 | 47192a9385a64 |
13 | 19b2c160a535b |
14 | a192bc87a204 |
15 | 4b0cc6e2c8ba |
hex | 25444001a3ac |
40975061853100 has 144 divisors (see below), whose sum is σ = 90109000654848. Its totient is φ = 16171455247360.
The previous prime is 40975061853073. The next prime is 40975061853119. The reversal of 40975061853100 is 135816057904.
It is a super-2 number, since 2×409750618531002 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3044881572 + ... + 3044895028.
It is an arithmetic number, because the mean of its divisors is an integer number (625756948992).
Almost surely, 240975061853100 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40975061853100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45054500327424).
40975061853100 is an abundant number, since it is smaller than the sum of its proper divisors (49133938801748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40975061853100 is a wasteful number, since it uses less digits than its factorization.
40975061853100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14704 (or 14697 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 49.
The spelling of 40975061853100 in words is "forty trillion, nine hundred seventy-five billion, sixty-one million, eight hundred fifty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •