Base | Representation |
---|---|
bin | 11101100011111001011101… |
… | …000011010100111100010101 |
3 | 122001022212002212000012200002 |
4 | 131203321131003110330111 |
5 | 114020041413112000341 |
6 | 1140301512053501045 |
7 | 36245633323410662 |
oct | 3543713503247425 |
9 | 561285085005602 |
10 | 130010221203221 |
11 | 38475030567517 |
12 | 126b8a28041785 |
13 | 5770bb0041928 |
14 | 2416757862a69 |
15 | 1006ce6a9d29b |
hex | 763e5d0d4f15 |
130010221203221 has 16 divisors (see below), whose sum is σ = 130654735863168. Its totient is φ = 129367060804800.
The previous prime is 130010221203173. The next prime is 130010221203227. The reversal of 130010221203221 is 122302122010031.
It is a cyclic number.
It is not a de Polignac number, because 130010221203221 - 218 = 130010220941077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130010221203193 and 130010221203202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130010221203227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 779854751 + ... + 780021443.
It is an arithmetic number, because the mean of its divisors is an integer number (8165920991448).
Almost surely, 2130010221203221 is an apocalyptic number.
It is an amenable number.
130010221203221 is a deficient number, since it is larger than the sum of its proper divisors (644514659947).
130010221203221 is a wasteful number, since it uses less digits than its factorization.
130010221203221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170732.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 130010221203221 its reverse (122302122010031), we get a palindrome (252312343213252).
The spelling of 130010221203221 in words is "one hundred thirty trillion, ten billion, two hundred twenty-one million, two hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •