Base | Representation |
---|---|
bin | 100101101000101011… |
… | …110001110000111000 |
3 | 10212022022110010011210 |
4 | 211220223301300320 |
5 | 1130230204342102 |
6 | 30321540123120 |
7 | 2630264635650 |
oct | 455053616070 |
9 | 125268403153 |
10 | 40411012152 |
11 | 16157a65605 |
12 | 79b96964a0 |
13 | 3a7027b314 |
14 | 1d54ddb360 |
15 | 10b7b2336c |
hex | 968af1c38 |
40411012152 has 32 divisors (see below), whose sum is σ = 115460035200. Its totient is φ = 11546003424.
The previous prime is 40411012141. The next prime is 40411012199. The reversal of 40411012152 is 25121011404.
It is a super-2 number, since 2×404110121522 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 120270702 + ... + 120271037.
It is an arithmetic number, because the mean of its divisors is an integer number (3608126100).
Almost surely, 240411012152 is an apocalyptic number.
40411012152 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
40411012152 is an abundant number, since it is smaller than the sum of its proper divisors (75049023048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40411012152 is a wasteful number, since it uses less digits than its factorization.
40411012152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240541755 (or 240541751 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 40411012152 its reverse (25121011404), we get a palindrome (65532023556).
The spelling of 40411012152 in words is "forty billion, four hundred eleven million, twelve thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •