Base | Representation |
---|---|
bin | 11101011111011010111… |
… | …00101000101000011101 |
3 | 10120212111200122022102100 |
4 | 32233231130220220131 |
5 | 113100220030134323 |
6 | 2053300513315313 |
7 | 133131354365355 |
oct | 16575534505035 |
9 | 3525450568370 |
10 | 1013301021213 |
11 | 360814012008 |
12 | 144474565b39 |
13 | 74727b350b0 |
14 | 37088b6db65 |
15 | 1b559329943 |
hex | ebed728a1d |
1013301021213 has 24 divisors (see below), whose sum is σ = 1599772105568. Its totient is φ = 614262841632.
The previous prime is 1013301021179. The next prime is 1013301021233. The reversal of 1013301021213 is 3121201033101.
1013301021213 is a `hidden beast` number, since 101 + 330 + 1 + 0 + 21 + 213 = 666.
It is not a de Polignac number, because 1013301021213 - 224 = 1013284243997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013301021233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 64624195 + ... + 64639872.
Almost surely, 21013301021213 is an apocalyptic number.
1013301021213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1013301021213 is a deficient number, since it is larger than the sum of its proper divisors (586471084355).
1013301021213 is a wasteful number, since it uses less digits than its factorization.
1013301021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129264153 (or 129264150 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1013301021213 its reverse (3121201033101), we get a palindrome (4134502054314).
The spelling of 1013301021213 in words is "one trillion, thirteen billion, three hundred one million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •