Base | Representation |
---|---|
bin | 111100110110010111… |
… | …1010111101100011111 |
3 | 110111021212000021212211 |
4 | 1321230233113230133 |
5 | 4120104341013111 |
6 | 140010331541251 |
7 | 12304131240532 |
oct | 1715457275437 |
9 | 414255007784 |
10 | 130673376031 |
11 | 50466794550 |
12 | 213aa2ba827 |
13 | c4265517a3 |
14 | 6478ab2a19 |
15 | 35ec027521 |
hex | 1e6cbd7b1f |
130673376031 has 16 divisors (see below), whose sum is σ = 145560459168. Its totient is φ = 116311334400.
The previous prime is 130673376017. The next prime is 130673376049.
It is a happy number.
130673376031 is nontrivially palindromic in base 10.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130673376031 is a prime.
It is a super-2 number, since 2×1306733760312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130673376011) 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, 483900 + ... + 703921.
It is an arithmetic number, because the mean of its divisors is an integer number (9097528698).
Almost surely, 2130673376031 is an apocalyptic number.
130673376031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130673376031 is a deficient number, since it is larger than the sum of its proper divisors (14887083137).
130673376031 is a wasteful number, since it uses less digits than its factorization.
130673376031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188042.
The product of its (nonzero) digits is 142884, while the sum is 40.
It can be divided in two parts, 1306 and 73376031, that added together give a palindrome (73377337).
The spelling of 130673376031 in words is "one hundred thirty billion, six hundred seventy-three million, three hundred seventy-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •