Base | Representation |
---|---|
bin | 11000110110010011… |
… | …01001000111010101 |
3 | 1021102201100021021000 |
4 | 30123021221013111 |
5 | 204310121230141 |
6 | 10043431213513 |
7 | 651405436335 |
oct | 143311510725 |
9 | 37381307230 |
10 | 13340414421 |
11 | 5726352894 |
12 | 2703817299 |
13 | 1347a7cb59 |
14 | 907a5d0c5 |
15 | 5312955b6 |
hex | 31b2691d5 |
13340414421 has 32 divisors (see below), whose sum is σ = 20398694400. Its totient is φ = 8612310960.
The previous prime is 13340414413. The next prime is 13340414441. The reversal of 13340414421 is 12441404331.
13340414421 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 13340414421 - 23 = 13340414413 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13340414441) 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 31 ways as a sum of consecutive naturals, for example, 44236 + ... + 169226.
It is an arithmetic number, because the mean of its divisors is an integer number (637459200).
Almost surely, 213340414421 is an apocalyptic number.
It is an amenable number.
13340414421 is a deficient number, since it is larger than the sum of its proper divisors (7058279979).
13340414421 is a wasteful number, since it uses less digits than its factorization.
13340414421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125126 (or 125120 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 13340414421 its reverse (12441404331), we get a palindrome (25781818752).
The spelling of 13340414421 in words is "thirteen billion, three hundred forty million, four hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •