Base | Representation |
---|---|
bin | 11110010001001011001… |
… | …01000010000110010000 |
3 | 10200102110021002121002111 |
4 | 33020211211002012100 |
5 | 114014421203104134 |
6 | 2113435234155104 |
7 | 135065323551232 |
oct | 17104545020620 |
9 | 3612407077074 |
10 | 1040012550544 |
11 | 371080a76390 |
12 | 14968a122a94 |
13 | 770c3b23856 |
14 | 384a0560252 |
15 | 1c0be3cbc64 |
hex | f225942190 |
1040012550544 has 80 divisors (see below), whose sum is σ = 2258093687040. Its totient is φ = 459859783680.
The previous prime is 1040012550539. The next prime is 1040012550571. The reversal of 1040012550544 is 4450552100401.
It is a happy number.
It is a super-2 number, since 2×10400125505442 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37384512 + ... + 37412320.
It is an arithmetic number, because the mean of its divisors is an integer number (28226171088).
Almost surely, 21040012550544 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1040012550544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1129046843520).
1040012550544 is an abundant number, since it is smaller than the sum of its proper divisors (1218081136496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040012550544 is a wasteful number, since it uses less digits than its factorization.
1040012550544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33608 (or 33602 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 31.
Adding to 1040012550544 its reverse (4450552100401), we get a palindrome (5490564650945).
The spelling of 1040012550544 in words is "one trillion, forty billion, twelve million, five hundred fifty thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •