Base | Representation |
---|---|
bin | 10010011000011111110000… |
… | …01000111101101011010010 |
3 | 12022010111200001111120220220 |
4 | 21030033320020331223102 |
5 | 20244302024140301002 |
6 | 221550324134013510 |
7 | 11341354614231135 |
oct | 1114177010755322 |
9 | 168114601446826 |
10 | 40424100322002 |
11 | 11975845861061 |
12 | 464a5654a7296 |
13 | 1972c8cc29367 |
14 | 9da77335021c |
15 | 4a17cc3217bc |
hex | 24c3f823dad2 |
40424100322002 has 128 divisors (see below), whose sum is σ = 84676992288768. Its totient is φ = 12853260403200.
The previous prime is 40424100321977. The next prime is 40424100322003. The reversal of 40424100322002 is 20022300142404.
40424100322002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (40424100322003) 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 63 ways as a sum of consecutive naturals, for example, 2190167958 + ... + 2190186414.
It is an arithmetic number, because the mean of its divisors is an integer number (661539002256).
Almost surely, 240424100322002 is an apocalyptic number.
40424100322002 is an abundant number, since it is smaller than the sum of its proper divisors (44252891966766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40424100322002 is a wasteful number, since it uses less digits than its factorization.
40424100322002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19344.
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 40424100322002 its reverse (20022300142404), we get a palindrome (60446400464406).
The spelling of 40424100322002 in words is "forty trillion, four hundred twenty-four billion, one hundred million, three hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •