Base | Representation |
---|---|
bin | 111100101000100100… |
… | …0100100110010100101 |
3 | 110110002120111120220222 |
4 | 1321101020210302211 |
5 | 4113132304034341 |
6 | 135452344534125 |
7 | 12256505422133 |
oct | 1712110446245 |
9 | 413076446828 |
10 | 130210221221 |
11 | 50249303483 |
12 | 2129b181345 |
13 | c3815ca2a2 |
14 | 643338c753 |
15 | 35c153b44b |
hex | 1e51224ca5 |
130210221221 has 4 divisors (see below), whose sum is σ = 130236568512. Its totient is φ = 130183873932.
The previous prime is 130210221187. The next prime is 130210221247. The reversal of 130210221221 is 122122012031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130210221221 - 26 = 130210221157 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 130210221221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130210221721) 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, 13166231 + ... + 13176116.
It is an arithmetic number, because the mean of its divisors is an integer number (32559142128).
Almost surely, 2130210221221 is an apocalyptic number.
It is an amenable number.
130210221221 is a deficient number, since it is larger than the sum of its proper divisors (26347291).
130210221221 is an equidigital number, since it uses as much as digits as its factorization.
130210221221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26347290.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 130210221221 its reverse (122122012031), we get a palindrome (252332233252).
The spelling of 130210221221 in words is "one hundred thirty billion, two hundred ten million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •