Base | Representation |
---|---|
bin | 11101101101111101000… |
… | …11000010001100110000 |
3 | 10121121122111112000000102 |
4 | 32312332203002030300 |
5 | 113212210122313430 |
6 | 2101031100411532 |
7 | 133525624451513 |
oct | 16667643021460 |
9 | 3547574460012 |
10 | 1021104104240 |
11 | 364058712860 |
12 | 145a91846ba8 |
13 | 7539c63029c |
14 | 375c9218d7a |
15 | 1b8643c9345 |
hex | edbe8c2330 |
1021104104240 has 80 divisors (see below), whose sum is σ = 2615036126976. Its totient is φ = 367705593600.
The previous prime is 1021104104227. The next prime is 1021104104257. The reversal of 1021104104240 is 424014011201.
1021104104240 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 5542106 + ... + 5723385.
Almost surely, 21021104104240 is an apocalyptic number.
1021104104240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021104104240 is an abundant number, since it is smaller than the sum of its proper divisors (1593932022736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021104104240 is a wasteful number, since it uses less digits than its factorization.
1021104104240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11265618 (or 11265612 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1021104104240 its reverse (424014011201), we get a palindrome (1445118115441).
The spelling of 1021104104240 in words is "one trillion, twenty-one billion, one hundred four million, one hundred four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •