Base | Representation |
---|---|
bin | 111100101000100101… |
… | …1111100010100010110 |
3 | 110110002122011102220022 |
4 | 1321101023330110112 |
5 | 4113133020312042 |
6 | 135452415505142 |
7 | 12256516056656 |
oct | 1712113742426 |
9 | 413078142808 |
10 | 130211104022 |
11 | 5024985676a |
12 | 2129b5281b2 |
13 | c38184905c |
14 | 643353c366 |
15 | 35c1662cd2 |
hex | 1e512fc516 |
130211104022 has 8 divisors (see below), whose sum is σ = 195433687200. Its totient is φ = 65066541624.
The previous prime is 130211103991. The next prime is 130211104033. The reversal of 130211104022 is 220401112031.
130211104022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1302111040222 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 19501022 + ... + 19507697.
It is an arithmetic number, because the mean of its divisors is an integer number (24429210900).
Almost surely, 2130211104022 is an apocalyptic number.
130211104022 is a deficient number, since it is larger than the sum of its proper divisors (65222583178).
130211104022 is a wasteful number, since it uses less digits than its factorization.
130211104022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39010390.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 130211104022 its reverse (220401112031), we get a palindrome (350612216053).
The spelling of 130211104022 in words is "one hundred thirty billion, two hundred eleven million, one hundred four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •