Base | Representation |
---|---|
bin | 111100101001001100… |
… | …0100110101000110111 |
3 | 110110011000222102211022 |
4 | 1321102120212220313 |
5 | 4113203141402221 |
6 | 135454414331355 |
7 | 12260151636512 |
oct | 1712230465067 |
9 | 413130872738 |
10 | 130231200311 |
11 | 5025a132373 |
12 | 212a61b9b5b |
13 | c385a64254 |
14 | 643608dd79 |
15 | 35c32d24ab |
hex | 1e52626a37 |
130231200311 has 8 divisors (see below), whose sum is σ = 131190799584. Its totient is φ = 129271731840.
The previous prime is 130231200301. The next prime is 130231200313. The reversal of 130231200311 is 113002132031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130231200311 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 130231200311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130231200313) 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, 2984531 + ... + 3027851.
It is an arithmetic number, because the mean of its divisors is an integer number (16398849948).
Almost surely, 2130231200311 is an apocalyptic number.
130231200311 is a deficient number, since it is larger than the sum of its proper divisors (959599273).
130231200311 is a wasteful number, since it uses less digits than its factorization.
130231200311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65401.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 130231200311 its reverse (113002132031), we get a palindrome (243233332342).
The spelling of 130231200311 in words is "one hundred thirty billion, two hundred thirty-one million, two hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •