Base | Representation |
---|---|
bin | 111100100010101000… |
… | …0101010000001100101 |
3 | 110102120200122202220220 |
4 | 1321011100222001211 |
5 | 4112230304410341 |
6 | 135420511114553 |
7 | 12251536243605 |
oct | 1710520520145 |
9 | 412520582826 |
10 | 130011013221 |
11 | 50156911571 |
12 | 21244512a59 |
13 | c34c25c62b |
14 | 6414b34c05 |
15 | 35adcdba66 |
hex | 1e4542a065 |
130011013221 has 4 divisors (see below), whose sum is σ = 173348017632. Its totient is φ = 86674008812.
The previous prime is 130011013183. The next prime is 130011013229. The reversal of 130011013221 is 122310110031.
It is a happy number.
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 130011013221 - 29 = 130011012709 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 130011013221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130011013229) 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, 21668502201 + ... + 21668502206.
It is an arithmetic number, because the mean of its divisors is an integer number (43337004408).
Almost surely, 2130011013221 is an apocalyptic number.
It is an amenable number.
130011013221 is a deficient number, since it is larger than the sum of its proper divisors (43337004411).
130011013221 is an equidigital number, since it uses as much as digits as its factorization.
130011013221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43337004410.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 130011013221 its reverse (122310110031), we get a palindrome (252321123252).
The spelling of 130011013221 in words is "one hundred thirty billion, eleven million, thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •