Base | Representation |
---|---|
bin | 111101000000011111… |
… | …1010110100100010001 |
3 | 110112011112021120022122 |
4 | 1322000333112210101 |
5 | 4121303324010113 |
6 | 140104145344025 |
7 | 12315425026631 |
oct | 1720077264421 |
9 | 415145246278 |
10 | 131013110033 |
11 | 50620537753 |
12 | 21484038015 |
13 | c47ba52020 |
14 | 64abc6a6c1 |
15 | 361bc84408 |
hex | 1e80fd6911 |
131013110033 has 16 divisors (see below), whose sum is σ = 143518314240. Its totient is φ = 118855686144.
The previous prime is 131013110003. The next prime is 131013110077. The reversal of 131013110033 is 330011310131.
It is not a de Polignac number, because 131013110033 - 216 = 131013044497 is a prime.
It is a super-2 number, since 2×1310131100332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131013109993 and 131013110020.
It is not an unprimeable number, because it can be changed into a prime (131013110003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3403985 + ... + 3442257.
It is an arithmetic number, because the mean of its divisors is an integer number (8969894640).
Almost surely, 2131013110033 is an apocalyptic number.
131013110033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131013110033 is a deficient number, since it is larger than the sum of its proper divisors (12505204207).
131013110033 is a wasteful number, since it uses less digits than its factorization.
131013110033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42808.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 131013110033 its reverse (330011310131), we get a palindrome (461024420164).
The spelling of 131013110033 in words is "one hundred thirty-one billion, thirteen million, one hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •