Base | Representation |
---|---|
bin | 10010001100110000011111… |
… | …00001011000110000010000 |
3 | 12020200221120222012120112111 |
4 | 21012120033201120300100 |
5 | 20221200012003041022 |
6 | 221041141432435104 |
7 | 11300255611261600 |
oct | 1106301741306020 |
9 | 166627528176474 |
10 | 40020765674512 |
11 | 1182a79097a747 |
12 | 45a4361548a94 |
13 | 1943c3279752c |
14 | 9c5030352c00 |
15 | 496072cce477 |
hex | 24660f858c10 |
40020765674512 has 60 divisors (see below), whose sum is σ = 95505737805180. Its totient is φ = 16142829846528.
The previous prime is 40020765674507. The next prime is 40020765674557. The reversal of 40020765674512 is 21547656702004.
It can be written as a sum of positive squares in 2 ways, for example, as 27742721642496 + 12278044032016 = 5267136^2 + 3504004^2 .
It is a Harshad number since it is a multiple of its sum of digits (49).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1501365937 + ... + 1501392592.
It is an arithmetic number, because the mean of its divisors is an integer number (1591762296753).
Almost surely, 240020765674512 is an apocalyptic number.
It is an amenable number.
40020765674512 is an abundant number, since it is smaller than the sum of its proper divisors (55484972130668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40020765674512 is a wasteful number, since it uses less digits than its factorization.
40020765674512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3002758568 (or 3002758555 counting only the distinct ones).
The product of its (nonzero) digits is 2822400, while the sum is 49.
The spelling of 40020765674512 in words is "forty trillion, twenty billion, seven hundred sixty-five million, six hundred seventy-four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •