Base | Representation |
---|---|
bin | 111100101001011101… |
… | …0010000001110100011 |
3 | 110110011122120121002201 |
4 | 1321102322100032203 |
5 | 4113212421141121 |
6 | 135455331354031 |
7 | 12260316626143 |
oct | 1712272201643 |
9 | 413148517081 |
10 | 130240021411 |
11 | 50264107835 |
12 | 212a9152917 |
13 | c387832336 |
14 | 6437308923 |
15 | 35c3e75e91 |
hex | 1e52e903a3 |
130240021411 has 4 divisors (see below), whose sum is σ = 137094759400. Its totient is φ = 123385283424.
The previous prime is 130240021399. The next prime is 130240021433. The reversal of 130240021411 is 114120042031.
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 130240021411 - 211 = 130240019363 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19), and also a Moran number because the ratio is a prime number: 6854737969 = 130240021411 / (1 + 3 + 0 + 2 + 4 + 0 + 0 + 2 + 1 + 4 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130240021481) 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, 3427368966 + ... + 3427369003.
It is an arithmetic number, because the mean of its divisors is an integer number (34273689850).
Almost surely, 2130240021411 is an apocalyptic number.
130240021411 is a deficient number, since it is larger than the sum of its proper divisors (6854737989).
130240021411 is an equidigital number, since it uses as much as digits as its factorization.
130240021411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6854737988.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 130240021411 its reverse (114120042031), we get a palindrome (244360063442).
The spelling of 130240021411 in words is "one hundred thirty billion, two hundred forty million, twenty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •