Base | Representation |
---|---|
bin | 11001000001000001… |
… | …11100111111101001 |
3 | 1021122222200120200120 |
4 | 30200200330333221 |
5 | 210001141124431 |
6 | 10100404153453 |
7 | 653550416622 |
oct | 144040747751 |
9 | 37588616616 |
10 | 13430411241 |
11 | 5772131825 |
12 | 2729998889 |
13 | 1360600500 |
14 | 9159a8a49 |
15 | 539121196 |
hex | 32083cfe9 |
13430411241 has 24 divisors (see below), whose sum is σ = 20059318080. Its totient is φ = 7979864256.
The previous prime is 13430411237. The next prime is 13430411273. The reversal of 13430411241 is 14211403431.
13430411241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13430411241 - 22 = 13430411237 is a prime.
It is a super-2 number, since 2×134304112412 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13430418241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 442021 + ... + 471426.
It is an arithmetic number, because the mean of its divisors is an integer number (835804920).
Almost surely, 213430411241 is an apocalyptic number.
It is an amenable number.
13430411241 is a deficient number, since it is larger than the sum of its proper divisors (6628906839).
13430411241 is a wasteful number, since it uses less digits than its factorization.
13430411241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913505 (or 913492 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 13430411241 its reverse (14211403431), we get a palindrome (27641814672).
The spelling of 13430411241 in words is "thirteen billion, four hundred thirty million, four hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •