Base | Representation |
---|---|
bin | 10010001100110111010101… |
… | …00011010111100000110110 |
3 | 12020201022002001212011202110 |
4 | 21012123222203113200312 |
5 | 20221230023220412042 |
6 | 221042550222551450 |
7 | 11300445642045654 |
oct | 1106335243274066 |
9 | 166638061764673 |
10 | 40024440404022 |
11 | 118312a719a388 |
12 | 45a5008138586 |
13 | 1944399bb0aa9 |
14 | 9c529c3d5dd4 |
15 | 4961da70309c |
hex | 2466ea8d7836 |
40024440404022 has 32 divisors (see below), whose sum is σ = 80418975144192. Its totient is φ = 13279920989984.
The previous prime is 40024440403957. The next prime is 40024440404023. The reversal of 40024440404022 is 22040404442004.
40024440404022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40024440404023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14106018 + ... + 16704149.
It is an arithmetic number, because the mean of its divisors is an integer number (2513092973256).
Almost surely, 240024440404022 is an apocalyptic number.
40024440404022 is an abundant number, since it is smaller than the sum of its proper divisors (40394534740170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40024440404022 is a wasteful number, since it uses less digits than its factorization.
40024440404022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30811172.
The product of its (nonzero) digits is 32768, while the sum is 30.
Adding to 40024440404022 its reverse (22040404442004), we get a palindrome (62064844846026).
The spelling of 40024440404022 in words is "forty trillion, twenty-four billion, four hundred forty million, four hundred four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •