Base | Representation |
---|---|
bin | 111100100010101100… |
… | …1011000100111100111 |
3 | 110102120211222000110201 |
4 | 1321011121120213213 |
5 | 4112231401114343 |
6 | 135421032131331 |
7 | 12251564553301 |
oct | 1710531304747 |
9 | 412524860421 |
10 | 130013301223 |
11 | 50158134583 |
12 | 21245236b47 |
13 | c34c880b90 |
14 | 641516c971 |
15 | 35ae0de94d |
hex | 1e456589e7 |
130013301223 has 4 divisors (see below), whose sum is σ = 140014324408. Its totient is φ = 120012278040.
The previous prime is 130013301191. The next prime is 130013301227. The reversal of 130013301223 is 322103310031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130013301223 - 25 = 130013301191 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 130013301223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130013301227) 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, 5000511573 + ... + 5000511598.
It is an arithmetic number, because the mean of its divisors is an integer number (35003581102).
Almost surely, 2130013301223 is an apocalyptic number.
130013301223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
130013301223 is a deficient number, since it is larger than the sum of its proper divisors (10001023185).
130013301223 is a wasteful number, since it uses less digits than its factorization.
130013301223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10001023184.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 130013301223 its reverse (322103310031), we get a palindrome (452116611254).
The spelling of 130013301223 in words is "one hundred thirty billion, thirteen million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •