Base | Representation |
---|---|
bin | 10000011101011010110… |
… | …111111010000011111000 |
3 | 11000010120101002110200200 |
4 | 100131122313322003320 |
5 | 122012443324112044 |
6 | 2223342020002200 |
7 | 144501510620445 |
oct | 20353267720370 |
9 | 4003511073620 |
10 | 1131101004024 |
11 | 3a6774035702 |
12 | 16326b530360 |
13 | 8287c2b3034 |
14 | 3ca61c329cc |
15 | 1e6510ad369 |
hex | 1075adfa0f8 |
1131101004024 has 48 divisors (see below), whose sum is σ = 3063655314720. Its totient is φ = 377002066560.
The previous prime is 1131101004017. The next prime is 1131101004031. The reversal of 1131101004024 is 4204001011311.
It is an interprime number because it is at equal distance from previous prime (1131101004017) and next prime (1131101004031).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1131101003988 and 1131101004006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 214609 + ... + 1519295.
It is an arithmetic number, because the mean of its divisors is an integer number (63826152390).
Almost surely, 21131101004024 is an apocalyptic number.
It is an amenable number.
1131101004024 is an abundant number, since it is smaller than the sum of its proper divisors (1932554310696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131101004024 is a wasteful number, since it uses less digits than its factorization.
1131101004024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1316740 (or 1316733 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1131101004024 its reverse (4204001011311), we get a palindrome (5335102015335).
The spelling of 1131101004024 in words is "one trillion, one hundred thirty-one billion, one hundred one million, four thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •