Base | Representation |
---|---|
bin | 10010001101000110000000… |
… | …11010101100101111100000 |
3 | 12020202001102110011001010201 |
4 | 21012203000122230233200 |
5 | 20221342144244020300 |
6 | 221050332343234544 |
7 | 11301145202441113 |
oct | 1106430032545740 |
9 | 166661373131121 |
10 | 40032323423200 |
11 | 11834681a28369 |
12 | 45a6648148a54 |
13 | 1945055116294 |
14 | 9c580932c57a |
15 | 4964ec7e266a |
hex | 2468c06acbe0 |
40032323423200 has 36 divisors (see below), whose sum is σ = 97728909558840. Its totient is φ = 16012929368960.
The previous prime is 40032323423149. The next prime is 40032323423231. The reversal of 40032323423200 is 232432323004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 25020201340 + ... + 25020202939.
It is an arithmetic number, because the mean of its divisors is an integer number (2714691932190).
Almost surely, 240032323423200 is an apocalyptic number.
40032323423200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40032323423200 is an abundant number, since it is smaller than the sum of its proper divisors (57696586135640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40032323423200 is a wasteful number, since it uses less digits than its factorization.
40032323423200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50040404299 (or 50040404286 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 28.
Adding to 40032323423200 its reverse (232432323004), we get a palindrome (40264755746204).
The spelling of 40032323423200 in words is "forty trillion, thirty-two billion, three hundred twenty-three million, four hundred twenty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.220 sec. • engine limits •