Base | Representation |
---|---|
bin | 111100101000010001… |
… | …0011011101001100111 |
3 | 110110001212200120222222 |
4 | 1321100202123221213 |
5 | 4113122224103221 |
6 | 135451350342555 |
7 | 12256324425605 |
oct | 1712042335147 |
9 | 413055616888 |
10 | 130200222311 |
11 | 502436a4115 |
12 | 2129795aa5b |
13 | c37c509083 |
14 | 6431d08875 |
15 | 35c07139ab |
hex | 1e5089ba67 |
130200222311 has 8 divisors (see below), whose sum is σ = 132479746560. Its totient is φ = 127923122872.
The previous prime is 130200222289. The next prime is 130200222371. The reversal of 130200222311 is 113222002031.
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 130200222311 - 230 = 129126480487 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 130200222311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130200222371) 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, 497705 + ... + 712818.
It is an arithmetic number, because the mean of its divisors is an integer number (16559968320).
Almost surely, 2130200222311 is an apocalyptic number.
130200222311 is a deficient number, since it is larger than the sum of its proper divisors (2279524249).
130200222311 is a wasteful number, since it uses less digits than its factorization.
130200222311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212405.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 130200222311 its reverse (113222002031), we get a palindrome (243422224342).
The spelling of 130200222311 in words is "one hundred thirty billion, two hundred million, two hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •