Base | Representation |
---|---|
bin | 11110010001001100000… |
… | …11100100100100001000 |
3 | 10200102110211011022120100 |
4 | 33020212003210210020 |
5 | 114014430230243130 |
6 | 2113440121525400 |
7 | 135065451602664 |
oct | 17104603444410 |
9 | 3612424138510 |
10 | 1040020556040 |
11 | 371085543aa4 |
12 | 149690943860 |
13 | 770c569762b |
14 | 384a16458a4 |
15 | 1c0bee5dc60 |
hex | f2260e4908 |
1040020556040 has 96 divisors (see below), whose sum is σ = 3404738989080. Its totient is φ = 275314430976.
The previous prime is 1040020556021. The next prime is 1040020556053. The reversal of 1040020556040 is 406550200401.
1040020556040 is a `hidden beast` number, since 1 + 0 + 4 + 0 + 0 + 2 + 0 + 55 + 604 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 678557472516 + 361463083524 = 823746^2 + 601218^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1040020555995 and 1040020556013.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10494279 + ... + 10592918.
Almost surely, 21040020556040 is an apocalyptic number.
1040020556040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1040020556040 is an abundant number, since it is smaller than the sum of its proper divisors (2364718433040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040020556040 is a wasteful number, since it uses less digits than its factorization.
1040020556040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21087351 (or 21087344 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 1040020556040 its reverse (406550200401), we get a palindrome (1446570756441).
The spelling of 1040020556040 in words is "one trillion, forty billion, twenty million, five hundred fifty-six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •