Base | Representation |
---|---|
bin | 1111100000110… |
… | …00011010010011 |
3 | 100001211221202121 |
4 | 13300120122103 |
5 | 231302422121 |
6 | 20524555111 |
7 | 3140013355 |
oct | 760303223 |
9 | 301757677 |
10 | 130123411 |
11 | 674a6710 |
12 | 376b2a97 |
13 | 20c5ca02 |
14 | 133d30d5 |
15 | b655141 |
hex | 7c18693 |
130123411 has 4 divisors (see below), whose sum is σ = 141952824. Its totient is φ = 118294000.
The previous prime is 130123403. The next prime is 130123417. The reversal of 130123411 is 114321031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 114321031 = 11 ⋅10392821.
It is not a de Polignac number, because 130123411 - 23 = 130123403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130123417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5914690 + ... + 5914711.
It is an arithmetic number, because the mean of its divisors is an integer number (35488206).
Almost surely, 2130123411 is an apocalyptic number.
130123411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130123411 is a deficient number, since it is larger than the sum of its proper divisors (11829413).
130123411 is a wasteful number, since it uses less digits than its factorization.
130123411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11829412.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 130123411 is about 11407.1648975545. The cubic root of 130123411 is about 506.7399525128.
Adding to 130123411 its reverse (114321031), we get a palindrome (244444442).
The spelling of 130123411 in words is "one hundred thirty million, one hundred twenty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •