Base | Representation |
---|---|
bin | 111100100101100101… |
… | …0110001001111100101 |
3 | 110102211121011121000000 |
4 | 1321023022301033211 |
5 | 4112431143230341 |
6 | 135434411411513 |
7 | 12254151612315 |
oct | 1711312611745 |
9 | 412747147000 |
10 | 130110133221 |
11 | 501a7861922 |
12 | 21271753b99 |
13 | c366955713 |
14 | 6423d77445 |
15 | 35b786a8b6 |
hex | 1e4b2b13e5 |
130110133221 has 14 divisors (see below), whose sum is σ = 195075962150. Its totient is φ = 86740088328.
The previous prime is 130110133217. The next prime is 130110133253. The reversal of 130110133221 is 122331011031.
130110133221 is a `hidden beast` number, since 1 + 301 + 10 + 1 + 332 + 21 = 666.
It can be written as a sum of positive squares in only one way, i.e., 92789688996 + 37320444225 = 304614^2 + 193185^2 .
It is not a de Polignac number, because 130110133221 - 22 = 130110133217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130110133194 and 130110133203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130110133721) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 89238046 + ... + 89239503.
Almost surely, 2130110133221 is an apocalyptic number.
It is an amenable number.
130110133221 is a deficient number, since it is larger than the sum of its proper divisors (64965828929).
130110133221 is an frugal number, since it uses more digits than its factorization.
130110133221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178477567 (or 178477552 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 130110133221 its reverse (122331011031), we get a palindrome (252441144252).
The spelling of 130110133221 in words is "one hundred thirty billion, one hundred ten million, one hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •