Base | Representation |
---|---|
bin | 10011011010011000101… |
… | …101110110111010101101 |
3 | 11201112021220011000222201 |
4 | 103122120231312322231 |
5 | 133324014004120023 |
6 | 2500455420541501 |
7 | 165243546036145 |
oct | 23323055667255 |
9 | 4645256130881 |
10 | 1334002020013 |
11 | 4748243aa083 |
12 | 1966566b1891 |
13 | 98a4663a500 |
14 | 487cd311925 |
15 | 24a79072bad |
hex | 13698b76ead |
1334002020013 has 48 divisors (see below), whose sum is σ = 1523618507136. Its totient is φ = 1165953035520.
The previous prime is 1334002019971. The next prime is 1334002020017. The reversal of 1334002020013 is 3100202004331.
It is not a de Polignac number, because 1334002020013 - 213 = 1334002011821 is a prime.
It is a super-2 number, since 2×13340020200132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1334002020017) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 74470528 + ... + 74488438.
It is an arithmetic number, because the mean of its divisors is an integer number (31742052232).
Almost surely, 21334002020013 is an apocalyptic number.
1334002020013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1334002020013 is a deficient number, since it is larger than the sum of its proper divisors (189616487123).
1334002020013 is a wasteful number, since it uses less digits than its factorization.
1334002020013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18294 (or 18281 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1334002020013 its reverse (3100202004331), we get a palindrome (4434204024344).
The spelling of 1334002020013 in words is "one trillion, three hundred thirty-four billion, two million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •