Base | Representation |
---|---|
bin | 1100001000101000011000… |
… | …1101100000110001100011 |
3 | 1202020112010012100102220220 |
4 | 3002022012031200301203 |
5 | 3222100234022013220 |
6 | 44213231223534123 |
7 | 2544646415460303 |
oct | 302120615406143 |
9 | 52215105312826 |
10 | 13342420110435 |
11 | 42845413528a9 |
12 | 15b5a255ba343 |
13 | 75a253076990 |
14 | 341ac2d0b603 |
15 | 182101027540 |
hex | c2286360c63 |
13342420110435 has 16 divisors (see below), whose sum is σ = 22990016190624. Its totient is φ = 6568576054272.
The previous prime is 13342420110403. The next prime is 13342420110449. The reversal of 13342420110435 is 53401102424331.
It is not a de Polignac number, because 13342420110435 - 25 = 13342420110403 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13342420110396 and 13342420110405.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 34211333422 + ... + 34211333811.
It is an arithmetic number, because the mean of its divisors is an integer number (1436876011914).
Almost surely, 213342420110435 is an apocalyptic number.
13342420110435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13342420110435 is a deficient number, since it is larger than the sum of its proper divisors (9647596080189).
13342420110435 is a wasteful number, since it uses less digits than its factorization.
13342420110435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68422667254.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 13342420110435 its reverse (53401102424331), we get a palindrome (66743522534766).
The spelling of 13342420110435 in words is "thirteen trillion, three hundred forty-two billion, four hundred twenty million, one hundred ten thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •