Base | Representation |
---|---|
bin | 10000011110101010000… |
… | …110110100001001001101 |
3 | 11000021000000102022102220 |
4 | 100132222012310021031 |
5 | 122023204124441023 |
6 | 2224121543405553 |
7 | 144546451555110 |
oct | 20365206641115 |
9 | 4007000368386 |
10 | 1132430312013 |
11 | 3a7296430450 |
12 | 1635807538b9 |
13 | 82a31810000 |
14 | 3cb4a5c2577 |
15 | 1e6ccb3c3e3 |
hex | 107aa1b424d |
1132430312013 has 160 divisors (see below), whose sum is σ = 2094918574080. Its totient is φ = 528233322240.
The previous prime is 1132430311963. The next prime is 1132430312059. The reversal of 1132430312013 is 3102130342311.
It is not a de Polignac number, because 1132430312013 - 26 = 1132430311949 is a prime.
It is a super-2 number, since 2×11324303120132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132430312513) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 244108548 + ... + 244113186.
It is an arithmetic number, because the mean of its divisors is an integer number (13093241088).
Almost surely, 21132430312013 is an apocalyptic number.
1132430312013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1132430312013 is a deficient number, since it is larger than the sum of its proper divisors (962488262067).
1132430312013 is an equidigital number, since it uses as much as digits as its factorization.
1132430312013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4749 (or 4710 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1132430312013 its reverse (3102130342311), we get a palindrome (4234560654324).
The spelling of 1132430312013 in words is "one trillion, one hundred thirty-two billion, four hundred thirty million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •