Base | Representation |
---|---|
bin | 111100100101100101… |
… | …1011010010000011101 |
3 | 110102211121111010102221 |
4 | 1321023023122100131 |
5 | 4112431214114323 |
6 | 135434415145341 |
7 | 12254153212144 |
oct | 1711313322035 |
9 | 412747433387 |
10 | 130110301213 |
11 | 501a7967062 |
12 | 21271815251 |
13 | c3669b4019 |
14 | 6423dbc75b |
15 | 35b78a055d |
hex | 1e4b2da41d |
130110301213 has 4 divisors (see below), whose sum is σ = 130151387520. Its totient is φ = 130069214908.
The previous prime is 130110301187. The next prime is 130110301231. The reversal of 130110301213 is 312103011031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130110301213 - 225 = 130076746781 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 (130110301813) 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 3 ways as a sum of consecutive naturals, for example, 20538403 + ... + 20544736.
It is an arithmetic number, because the mean of its divisors is an integer number (32537846880).
Almost surely, 2130110301213 is an apocalyptic number.
It is an amenable number.
130110301213 is a deficient number, since it is larger than the sum of its proper divisors (41086307).
130110301213 is an equidigital number, since it uses as much as digits as its factorization.
130110301213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41086306.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 130110301213 its reverse (312103011031), we get a palindrome (442213312244).
The spelling of 130110301213 in words is "one hundred thirty billion, one hundred ten million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •