Base | Representation |
---|---|
bin | 10011000111100010010110… |
… | …10010011111011111000000 |
3 | 12111212000121222012112202011 |
4 | 21203301023102133133000 |
5 | 21002242221134011000 |
6 | 225225032230302304 |
7 | 11566214243463022 |
oct | 1143611322373700 |
9 | 174760558175664 |
10 | 42040403032000 |
11 | 1243926457a89a |
12 | 486b865ab7994 |
13 | 1a5c515544a59 |
14 | a54aa2c8a012 |
15 | 4cd879c932ba |
hex | 263c4b49f7c0 |
42040403032000 has 56 divisors (see below), whose sum is σ = 104113058128560. Its totient is φ = 16816161209600.
The previous prime is 42040403031989. The next prime is 42040403032073. The reversal of 42040403032000 is 23030404024.
42040403032000 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 an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2627517190 + ... + 2627533189.
Almost surely, 242040403032000 is an apocalyptic number.
42040403032000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42040403032000 is an abundant number, since it is smaller than the sum of its proper divisors (62072655096560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42040403032000 is an equidigital number, since it uses as much as digits as its factorization.
42040403032000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5255050406 (or 5255050386 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 22.
Adding to 42040403032000 its reverse (23030404024), we get a palindrome (42063433436024).
The spelling of 42040403032000 in words is "forty-two trillion, forty billion, four hundred three million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •