Base | Representation |
---|---|
bin | 100101011111001110… |
… | …110011001110001000 |
3 | 10211220021000212000102 |
4 | 211133032303032020 |
5 | 1124414104433000 |
6 | 30254113024532 |
7 | 2623330635041 |
oct | 453716631610 |
9 | 124807025012 |
10 | 40252421000 |
11 | 16086495740 |
12 | 7974555148 |
13 | 3a46461bbc |
14 | 1d3bd178c8 |
15 | 10a8c483d5 |
hex | 95f3b3388 |
40252421000 has 64 divisors (see below), whose sum is σ = 102753480960. Its totient is φ = 14637240000.
The previous prime is 40252420951. The next prime is 40252421017. The reversal of 40252421000 is 12425204.
It is a happy number.
It is a super-2 number, since 2×402524210002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1818656 + ... + 1840655.
It is an arithmetic number, because the mean of its divisors is an integer number (1605523140).
Almost surely, 240252421000 is an apocalyptic number.
40252421000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40252421000 is an abundant number, since it is smaller than the sum of its proper divisors (62501059960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40252421000 is a wasteful number, since it uses less digits than its factorization.
40252421000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3659343 (or 3659329 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 20.
Adding to 40252421000 its reverse (12425204), we get a palindrome (40264846204).
The spelling of 40252421000 in words is "forty billion, two hundred fifty-two million, four hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •