Base | Representation |
---|---|
bin | 100101010011001100… |
… | …010110011000110110 |
3 | 10211101011222202122220 |
4 | 211103030112120312 |
5 | 1124010403431042 |
6 | 30222100103210 |
7 | 2615326140150 |
oct | 452314263066 |
9 | 124334882586 |
10 | 40050452022 |
11 | 15a92488429 |
12 | 7918994b06 |
13 | 3a13668629 |
14 | 1d1d181ad0 |
15 | 10961508ec |
hex | 953316636 |
40050452022 has 64 divisors (see below), whose sum is σ = 92308930560. Its totient is φ = 11347682976.
The previous prime is 40050452021. The next prime is 40050452033. The reversal of 40050452022 is 22025405004.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 40050451983 and 40050452001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40050452021) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 3072643 + ... + 3085649.
It is an arithmetic number, because the mean of its divisors is an integer number (1442327040).
Almost surely, 240050452022 is an apocalyptic number.
40050452022 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
40050452022 is an abundant number, since it is smaller than the sum of its proper divisors (52258478538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40050452022 is a wasteful number, since it uses less digits than its factorization.
40050452022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13625.
The product of its (nonzero) digits is 3200, while the sum is 24.
Adding to 40050452022 its reverse (22025405004), we get a palindrome (62075857026).
The spelling of 40050452022 in words is "forty billion, fifty million, four hundred fifty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •