Base | Representation |
---|---|
bin | 111100101000111000… |
… | …1101111100010000011 |
3 | 110110010022210212122001 |
4 | 1321101301233202003 |
5 | 4113143034404443 |
6 | 135453412124431 |
7 | 12256666230325 |
oct | 1712161574203 |
9 | 413108725561 |
10 | 130221013123 |
11 | 50254404603 |
12 | 212a2906717 |
13 | c383908426 |
14 | 643499b615 |
15 | 35c246dd4d |
hex | 1e51c6f883 |
130221013123 has 8 divisors (see below), whose sum is σ = 131271478416. Its totient is φ = 129173616000.
The previous prime is 130221013057. The next prime is 130221013129. The reversal of 130221013123 is 321310122031.
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 130221013123 - 225 = 130187458691 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 130221013123.
It is not an unprimeable number, because it can be changed into a prime (130221013129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 681778 + ... + 851623.
It is an arithmetic number, because the mean of its divisors is an integer number (16408934802).
Almost surely, 2130221013123 is an apocalyptic number.
130221013123 is a deficient number, since it is larger than the sum of its proper divisors (1050465293).
130221013123 is a wasteful number, since it uses less digits than its factorization.
130221013123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1534085.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 130221013123 its reverse (321310122031), we get a palindrome (451531135154).
The spelling of 130221013123 in words is "one hundred thirty billion, two hundred twenty-one million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •