Base | Representation |
---|---|
bin | 11000010100001100… |
… | …10111000100101101 |
3 | 1020200210001020212201 |
4 | 30022012113010231 |
5 | 203213402411141 |
6 | 5555211501501 |
7 | 641333033302 |
oct | 141206270455 |
9 | 36623036781 |
10 | 13054341421 |
11 | 5599920a20 |
12 | 2643a57891 |
13 | 130071a1a4 |
14 | 8bba730a9 |
15 | 5160d8031 |
hex | 30a19712d |
13054341421 has 8 divisors (see below), whose sum is σ = 14243342688. Its totient is φ = 11865714000.
The previous prime is 13054341413. The next prime is 13054341427. The reversal of 13054341421 is 12414345031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13054341421 - 23 = 13054341413 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13054341421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13054341427) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17775 + ... + 162556.
It is an arithmetic number, because the mean of its divisors is an integer number (1780417836).
Almost surely, 213054341421 is an apocalyptic number.
13054341421 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13054341421 is a deficient number, since it is larger than the sum of its proper divisors (1189001267).
13054341421 is a wasteful number, since it uses less digits than its factorization.
13054341421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186923.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 13054341421 its reverse (12414345031), we get a palindrome (25468686452).
The spelling of 13054341421 in words is "thirteen billion, fifty-four million, three hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •