Base | Representation |
---|---|
bin | 11101101110101011000001… |
… | …110011111111100001000111 |
3 | 122010221122021022222221202210 |
4 | 131232223001303333201013 |
5 | 114114204310342311111 |
6 | 1142030003444034503 |
7 | 36353264620003110 |
oct | 3556530163774107 |
9 | 563848238887683 |
10 | 130750646057031 |
11 | 38730046045100 |
12 | 127b8426992a33 |
13 | 57c596b5951c0 |
14 | 2440517929207 |
15 | 101b1ceab00a6 |
hex | 76eac1cff847 |
130750646057031 has 96 divisors (see below), whose sum is σ = 249717550731264. Its totient is φ = 59009517388800.
The previous prime is 130750646056903. The next prime is 130750646057107.
130750646057031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 130750646057031 - 27 = 130750646056903 is a prime.
It is a super-2 number, since 2×1307506460570312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130750646057231) 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, 115855575 + ... + 116978696.
It is an arithmetic number, because the mean of its divisors is an integer number (2601224486784).
Almost surely, 2130750646057031 is an apocalyptic number.
130750646057031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130750646057031 is a deficient number, since it is larger than the sum of its proper divisors (118966904674233).
130750646057031 is a wasteful number, since it uses less digits than its factorization.
130750646057031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 232834333 (or 232834322 counting only the distinct ones).
The product of its (nonzero) digits is 1587600, while the sum is 48.
The spelling of 130750646057031 in words is "one hundred thirty trillion, seven hundred fifty billion, six hundred forty-six million, fifty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •