Base | Representation |
---|---|
bin | 111100101000111001… |
… | …0111000000001000101 |
3 | 110110010100100221220021 |
4 | 1321101302320001011 |
5 | 4113143123410041 |
6 | 135453422335141 |
7 | 12260001605035 |
oct | 1712162700105 |
9 | 413110327807 |
10 | 130221310021 |
11 | 50254597680 |
12 | 212a2a2a4b1 |
13 | c3839b05ca |
14 | 6434a378c5 |
15 | 35c24cbcd1 |
hex | 1e51cb8045 |
130221310021 has 8 divisors (see below), whose sum is σ = 149536432800. Its totient is φ = 112152324240.
The previous prime is 130221309991. The next prime is 130221310031. The reversal of 130221310021 is 120013122031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130221310021 - 27 = 130221309893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130221309977 and 130221310004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130221310031) 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, 311534026 + ... + 311534443.
It is an arithmetic number, because the mean of its divisors is an integer number (18692054100).
Almost surely, 2130221310021 is an apocalyptic number.
130221310021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130221310021 is a deficient number, since it is larger than the sum of its proper divisors (19315122779).
130221310021 is a wasteful number, since it uses less digits than its factorization.
130221310021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 623068499.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 130221310021 its reverse (120013122031), we get a palindrome (250234432052).
The spelling of 130221310021 in words is "one hundred thirty billion, two hundred twenty-one million, three hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •