Base | Representation |
---|---|
bin | 1100001101001101101001… |
… | …0111001000110001010000 |
3 | 1202112001022102012210100110 |
4 | 3003103122113020301100 |
5 | 3224342444140043044 |
6 | 44313330500521320 |
7 | 2553434252013120 |
oct | 303233227106120 |
9 | 52461272183313 |
10 | 13421141331024 |
11 | 4304968435a99 |
12 | 16091350b0240 |
13 | 7647ba29368b |
14 | 34582dccac80 |
15 | 1841ac0e86b9 |
hex | c34da5c8c50 |
13421141331024 has 80 divisors (see below), whose sum is σ = 39636836794368. Its totient is φ = 3833400702336.
The previous prime is 13421141330969. The next prime is 13421141331041. The reversal of 13421141331024 is 42013314112431.
It is a junction number, because it is equal to n+sod(n) for n = 13421141330982 and 13421141331000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5242152 + ... + 7370375.
Almost surely, 213421141331024 is an apocalyptic number.
13421141331024 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13421141331024 is an abundant number, since it is smaller than the sum of its proper divisors (26215695463344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13421141331024 is a wasteful number, since it uses less digits than its factorization.
13421141331024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12615712 (or 12615706 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 13421141331024 its reverse (42013314112431), we get a palindrome (55434455443455).
The spelling of 13421141331024 in words is "thirteen trillion, four hundred twenty-one billion, one hundred forty-one million, three hundred thirty-one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •