Base | Representation |
---|---|
bin | 10000001100101100101… |
… | …000010101111000000100 |
3 | 10221102020000021022210111 |
4 | 100030230220111320010 |
5 | 121214210144140112 |
6 | 2211212155002404 |
7 | 143264530645504 |
oct | 20145450257004 |
9 | 3842200238714 |
10 | 1113145302532 |
11 | 39a09a55a38a |
12 | 15b89a139404 |
13 | 80c7a2c29b3 |
14 | 3bc3b257a04 |
15 | 1de4ea555a7 |
hex | 1032ca15e04 |
1113145302532 has 6 divisors (see below), whose sum is σ = 1948004279438. Its totient is φ = 556572651264.
The previous prime is 1113145302523. The next prime is 1113145302557. The reversal of 1113145302532 is 2352035413111.
It can be written as a sum of positive squares in only one way, i.e., 1103390579776 + 9754722756 = 1050424^2 + 98766^2 .
It is a super-2 number, since 2×11131453025322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1113145302494 and 1113145302503.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 139143162813 + ... + 139143162820.
Almost surely, 21113145302532 is an apocalyptic number.
It is an amenable number.
1113145302532 is a deficient number, since it is larger than the sum of its proper divisors (834858976906).
1113145302532 is a wasteful number, since it uses less digits than its factorization.
1113145302532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278286325637 (or 278286325635 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 1113145302532 in words is "one trillion, one hundred thirteen billion, one hundred forty-five million, three hundred two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •