Base | Representation |
---|---|
bin | 11101101000010000110000… |
… | …100010111011011011001111 |
3 | 122002101112012110200112111121 |
4 | 131220100300202323123033 |
5 | 114040000112242121221 |
6 | 1141051351013301411 |
7 | 36306411210130222 |
oct | 3550206042733317 |
9 | 562345173615447 |
10 | 130310122223311 |
11 | 385802378a9738 |
12 | 12746b84334867 |
13 | 57932654c6134 |
14 | 242708779b5b9 |
15 | 100e9ea709a41 |
hex | 7684308bb6cf |
130310122223311 has 8 divisors (see below), whose sum is σ = 135630590514480. Its totient is φ = 125044788318912.
The previous prime is 130310122223263. The next prime is 130310122223353. The reversal of 130310122223311 is 113322221013031.
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-130310122223311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130310122923311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13783591870 + ... + 13783601323.
It is an arithmetic number, because the mean of its divisors is an integer number (16953823814310).
Almost surely, 2130310122223311 is an apocalyptic number.
130310122223311 is a deficient number, since it is larger than the sum of its proper divisors (5320468291169).
130310122223311 is a wasteful number, since it uses less digits than its factorization.
130310122223311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27567193385.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 130310122223311 its reverse (113322221013031), we get a palindrome (243632343236342).
The spelling of 130310122223311 in words is "one hundred thirty trillion, three hundred ten billion, one hundred twenty-two million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •