Base | Representation |
---|---|
bin | 11101100100000100101000… |
… | …111101010001110010100101 |
3 | 122001101000002220122012012211 |
4 | 131210010220331101302211 |
5 | 114020241012404312401 |
6 | 1140311215553043421 |
7 | 36246540056365501 |
oct | 3544045075216245 |
9 | 561330086565184 |
10 | 130022232104101 |
11 | 3847a134394087 |
12 | 126bb21a556571 |
13 | 577207552207c |
14 | 2417176abb301 |
15 | 100729b273951 |
hex | 764128f51ca5 |
130022232104101 has 8 divisors (see below), whose sum is σ = 134775307980000. Its totient is φ = 125287126270320.
The previous prime is 130022232104059. The next prime is 130022232104117. The reversal of 130022232104101 is 101401232220031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130022232104101 - 219 = 130022231579813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130022232104131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4492495795 + ... + 4492524736.
It is an arithmetic number, because the mean of its divisors is an integer number (16846913497500).
Almost surely, 2130022232104101 is an apocalyptic number.
It is an amenable number.
130022232104101 is a deficient number, since it is larger than the sum of its proper divisors (4753075875899).
130022232104101 is an equidigital number, since it uses as much as digits as its factorization.
130022232104101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8985021059.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 130022232104101 its reverse (101401232220031), we get a palindrome (231423464324132).
The spelling of 130022232104101 in words is "one hundred thirty trillion, twenty-two billion, two hundred thirty-two million, one hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •