Base | Representation |
---|---|
bin | 111101000011101110… |
… | …0001001100011101110 |
3 | 110112110001220022112111 |
4 | 1322013130021203232 |
5 | 4122014024302342 |
6 | 140123012554234 |
7 | 12321210564232 |
oct | 1720734114356 |
9 | 415401808474 |
10 | 131121322222 |
11 | 50676628110 |
12 | 214b432297a |
13 | c4982ac6c7 |
14 | 64bc3985c2 |
15 | 362650c217 |
hex | 1e877098ee |
131121322222 has 8 divisors (see below), whose sum is σ = 214562163672. Its totient is φ = 59600601000.
The previous prime is 131121322147. The next prime is 131121322231. The reversal of 131121322222 is 222223121131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1311213222222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 5960060101 = 131121322222 / (1 + 3 + 1 + 1 + 2 + 1 + 3 + 2 + 2 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 131121322193 and 131121322202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2980030029 + ... + 2980030072.
It is an arithmetic number, because the mean of its divisors is an integer number (26820270459).
Almost surely, 2131121322222 is an apocalyptic number.
131121322222 is a deficient number, since it is larger than the sum of its proper divisors (83440841450).
131121322222 is a wasteful number, since it uses less digits than its factorization.
131121322222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5960060114.
The product of its digits is 576, while the sum is 22.
Adding to 131121322222 its reverse (222223121131), we get a palindrome (353344443353).
The spelling of 131121322222 in words is "one hundred thirty-one billion, one hundred twenty-one million, three hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •