Base | Representation |
---|---|
bin | 11101011111010000011… |
… | …01001111100010110101 |
3 | 10120212021120012110111000 |
4 | 32233220031033202311 |
5 | 113100030023201323 |
6 | 2053244053033513 |
7 | 133126236152046 |
oct | 16575015174265 |
9 | 3525246173430 |
10 | 1013213100213 |
11 | 360779420726 |
12 | 14444b025899 |
13 | 74712860532 |
14 | 3707b2048cd |
15 | 1b55175de43 |
hex | ebe834f8b5 |
1013213100213 has 32 divisors (see below), whose sum is σ = 1505673169920. Its totient is φ = 673398638640.
The previous prime is 1013213100209. The next prime is 1013213100223. The reversal of 1013213100213 is 3120013123101.
1013213100213 is a `hidden beast` number, since 10 + 1 + 321 + 310 + 0 + 21 + 3 = 666.
It is not a de Polignac number, because 1013213100213 - 22 = 1013213100209 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013213100223) 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 31 ways as a sum of consecutive naturals, for example, 88353306 + ... + 88364772.
It is an arithmetic number, because the mean of its divisors is an integer number (47052286560).
Almost surely, 21013213100213 is an apocalyptic number.
It is an amenable number.
1013213100213 is a deficient number, since it is larger than the sum of its proper divisors (492460069707).
1013213100213 is a wasteful number, since it uses less digits than its factorization.
1013213100213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21254 (or 21248 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1013213100213 its reverse (3120013123101), we get a palindrome (4133226223314).
The spelling of 1013213100213 in words is "one trillion, thirteen billion, two hundred thirteen million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •