Base | Representation |
---|---|
bin | 11000110110010111… |
… | …11010100111110101 |
3 | 1021102202110112211002 |
4 | 30123023322213311 |
5 | 204310244313141 |
6 | 10043452053045 |
7 | 651413501054 |
oct | 143313724765 |
9 | 37382415732 |
10 | 13341010421 |
11 | 572671a652 |
12 | 2703a64185 |
13 | 1347c2b20b |
14 | 907b7639b |
15 | 531361e9b |
hex | 31b2fa9f5 |
13341010421 has 4 divisors (see below), whose sum is σ = 13341243072. Its totient is φ = 13340777772.
The previous prime is 13341010411. The next prime is 13341010427. The reversal of 13341010421 is 12401014331.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13341010421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13341010393 and 13341010402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13341010427) 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, 37460 + ... + 167586.
It is an arithmetic number, because the mean of its divisors is an integer number (3335310768).
Almost surely, 213341010421 is an apocalyptic number.
It is an amenable number.
13341010421 is a deficient number, since it is larger than the sum of its proper divisors (232651).
13341010421 is a wasteful number, since it uses less digits than its factorization.
13341010421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232650.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 13341010421 its reverse (12401014331), we get a palindrome (25742024752).
The spelling of 13341010421 in words is "thirteen billion, three hundred forty-one million, ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •