Base | Representation |
---|---|
bin | 111100100101010010… |
… | …1011000001100101111 |
3 | 110102210220201121022022 |
4 | 1321022211120030233 |
5 | 4112421141100221 |
6 | 135433421340355 |
7 | 12254002366316 |
oct | 1711245301457 |
9 | 412726647268 |
10 | 130100331311 |
11 | 501a2277575 |
12 | 2126a4076bb |
13 | c364903082 |
14 | 642294527d |
15 | 35b6a814ab |
hex | 1e4a95832f |
130100331311 has 8 divisors (see below), whose sum is σ = 134325714048. Its totient is φ = 125876736000.
The previous prime is 130100331307. The next prime is 130100331353. The reversal of 130100331311 is 113133001031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130100331311 - 22 = 130100331307 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130100331311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130100331371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 298130 + ... + 590831.
It is an arithmetic number, because the mean of its divisors is an integer number (16790714256).
Almost surely, 2130100331311 is an apocalyptic number.
130100331311 is a deficient number, since it is larger than the sum of its proper divisors (4225382737).
130100331311 is an equidigital number, since it uses as much as digits as its factorization.
130100331311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893713.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 130100331311 its reverse (113133001031), we get a palindrome (243233332342).
The spelling of 130100331311 in words is "one hundred thirty billion, one hundred million, three hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •