Base | Representation |
---|---|
bin | 111100101000110111… |
… | …1000110100101010111 |
3 | 110110010021111201100222 |
4 | 1321101233012211113 |
5 | 4113142400233421 |
6 | 135453345224555 |
7 | 12256660315646 |
oct | 1712157064527 |
9 | 413107451328 |
10 | 130220321111 |
11 | 50253a816a1 |
12 | 212a263215b |
13 | c38372545a |
14 | 643485b35d |
15 | 35c2383cab |
hex | 1e51bc6957 |
130220321111 has 4 divisors (see below), whose sum is σ = 130228884912. Its totient is φ = 130211757312.
The previous prime is 130220321081. The next prime is 130220321117. The reversal of 130220321111 is 111123022031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111123022031 = 7 ⋅15874717433.
It is a cyclic number.
It is not a de Polignac number, because 130220321111 - 214 = 130220304727 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 130220321111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130220321117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4259051 + ... + 4289516.
It is an arithmetic number, because the mean of its divisors is an integer number (32557221228).
Almost surely, 2130220321111 is an apocalyptic number.
130220321111 is a deficient number, since it is larger than the sum of its proper divisors (8563801).
130220321111 is an equidigital number, since it uses as much as digits as its factorization.
130220321111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8563800.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 130220321111 its reverse (111123022031), we get a palindrome (241343343142).
The spelling of 130220321111 in words is "one hundred thirty billion, two hundred twenty million, three hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •