Base | Representation |
---|---|
bin | 10010011011000010000001… |
… | …11000111110010111010000 |
3 | 12022102211112120221121111212 |
4 | 21031201000320332113100 |
5 | 20302213434333310300 |
6 | 222054333031355252 |
7 | 11350560542131052 |
oct | 1115410070762720 |
9 | 168384476847455 |
10 | 40511220213200 |
11 | 119a9791759840 |
12 | 4663419822b28 |
13 | 197b265153639 |
14 | a00a799338d2 |
15 | 4a3bca8dc935 |
hex | 24d840e3e5d0 |
40511220213200 has 480 divisors, whose sum is σ = 111559472736768. Its totient is φ = 14003877888000.
The previous prime is 40511220213161. The next prime is 40511220213229. The reversal of 40511220213200 is 231202211504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4721032910 + ... + 4721041490.
Almost surely, 240511220213200 is an apocalyptic number.
40511220213200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40511220213200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55779736368384).
40511220213200 is an abundant number, since it is smaller than the sum of its proper divisors (71048252523568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40511220213200 is a wasteful number, since it uses less digits than its factorization.
40511220213200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9311 (or 9300 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 40511220213200 its reverse (231202211504), we get a palindrome (40742422424704).
The spelling of 40511220213200 in words is "forty trillion, five hundred eleven billion, two hundred twenty million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •