Base | Representation |
---|---|
bin | 11101011111001011100… |
… | …11100100110011101011 |
3 | 10120212011202101212111000 |
4 | 32233211303210303223 |
5 | 113044434220122011 |
6 | 2053240053410043 |
7 | 133125236564466 |
oct | 16574563446353 |
9 | 3525152355430 |
10 | 1013172817131 |
11 | 360758707422 |
12 | 144439639923 |
13 | 747073c7ba7 |
14 | 37075b1a2dd |
15 | 1b54ce53356 |
hex | ebe5ce4ceb |
1013172817131 has 96 divisors (see below), whose sum is σ = 1580958259200. Its totient is φ = 640561392000.
The previous prime is 1013172817123. The next prime is 1013172817159. The reversal of 1013172817131 is 1317182713101.
It is a happy number.
It is not a de Polignac number, because 1013172817131 - 23 = 1013172817123 is a prime.
It is a super-2 number, since 2×10131728171312 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (1013172817231) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 913590805 + ... + 913591913.
It is an arithmetic number, because the mean of its divisors is an integer number (16468315200).
Almost surely, 21013172817131 is an apocalyptic number.
1013172817131 is a deficient number, since it is larger than the sum of its proper divisors (567785442069).
1013172817131 is a wasteful number, since it uses less digits than its factorization.
1013172817131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1458 (or 1351 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 36.
The spelling of 1013172817131 in words is "one trillion, thirteen billion, one hundred seventy-two million, eight hundred seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •