Base | Representation |
---|---|
bin | 110100100011011000101011… |
… | …100101011110011010011010 |
3 | 1010022100211012011022121220110 |
4 | 310203120223211132122122 |
5 | 220243313421413424010 |
6 | 2135323411441505150 |
7 | 66453412242453120 |
oct | 6443305345363232 |
9 | 1108324164277813 |
10 | 231130101311130 |
11 | 677107a8705a2a |
12 | 21b0a68b3421b6 |
13 | 9bc76238509a8 |
14 | 4110a84135910 |
15 | 1bac3572a6120 |
hex | d2362b95e69a |
231130101311130 has 128 divisors (see below), whose sum is σ = 668314571673600. Its totient is φ = 49974857017344.
The previous prime is 231130101311101. The next prime is 231130101311147. The reversal of 231130101311130 is 31113101031132.
It is a super-2 number, since 2×2311301013111302 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 231130101311097 and 231130101311106.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40351390 + ... + 45721929.
It is an arithmetic number, because the mean of its divisors is an integer number (5221207591200).
Almost surely, 2231130101311130 is an apocalyptic number.
231130101311130 is an abundant number, since it is smaller than the sum of its proper divisors (437184470362470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231130101311130 is a wasteful number, since it uses less digits than its factorization.
231130101311130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86074028.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 231130101311130 its reverse (31113101031132), we get a palindrome (262243202342262).
The spelling of 231130101311130 in words is "two hundred thirty-one trillion, one hundred thirty billion, one hundred one million, three hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •