Base | Representation |
---|---|
bin | 100101011101100010… |
… | …111001001110000110 |
3 | 10211211021210201120120 |
4 | 211131202321032012 |
5 | 1124334334242042 |
6 | 30251222442410 |
7 | 2622535332522 |
oct | 453542711606 |
9 | 124737721516 |
10 | 40224134022 |
11 | 16071525276 |
12 | 7966b93406 |
13 | 3a40639847 |
14 | 1d38272d82 |
15 | 10a650bdec |
hex | 95d8b9386 |
40224134022 has 8 divisors (see below), whose sum is σ = 80448268056. Its totient is φ = 13408044672.
The previous prime is 40224134021. The next prime is 40224134051. The reversal of 40224134022 is 22043142204.
40224134022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
40224134022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 40224133983 and 40224134001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40224134021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3352011163 + ... + 3352011174.
It is an arithmetic number, because the mean of its divisors is an integer number (10056033507).
Almost surely, 240224134022 is an apocalyptic number.
40224134022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40224134022 is a wasteful number, since it uses less digits than its factorization.
40224134022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6704022342.
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 40224134022 its reverse (22043142204), we get a palindrome (62267276226).
The spelling of 40224134022 in words is "forty billion, two hundred twenty-four million, one hundred thirty-four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •