Base | Representation |
---|---|
bin | 100101010001000001… |
… | …011000101100000000 |
3 | 10211021122110000000120 |
4 | 211101001120230000 |
5 | 1123422042222144 |
6 | 30214315220240 |
7 | 2614404405264 |
oct | 452101305400 |
9 | 124248400016 |
10 | 40014023424 |
11 | 15a73967051 |
12 | 7908747680 |
13 | 3a08c5254b |
14 | 1d183bc0a4 |
15 | 1092d56e19 |
hex | 951058b00 |
40014023424 has 36 divisors (see below), whose sum is σ = 106495658136. Its totient is φ = 13338007552.
The previous prime is 40014023359. The next prime is 40014023449. The reversal of 40014023424 is 42432041004.
It is a happy number.
It is a super-2 number, since 2×400140234242 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 40014023394 and 40014023403.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26050029 + ... + 26051564.
It is an arithmetic number, because the mean of its divisors is an integer number (2958212726).
Almost surely, 240014023424 is an apocalyptic number.
It is an amenable number.
40014023424 is an abundant number, since it is smaller than the sum of its proper divisors (66481634712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40014023424 is an equidigital number, since it uses as much as digits as its factorization.
40014023424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52101612 (or 52101598 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 40014023424 its reverse (42432041004), we get a palindrome (82446064428).
The spelling of 40014023424 in words is "forty billion, fourteen million, twenty-three thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •