Base | Representation |
---|---|
bin | 1001010010011110011001… |
… | …1011000101001000111101 |
3 | 1100011100112202011221021202 |
4 | 2110213212123011020331 |
5 | 2314312212244334323 |
6 | 33415442221105245 |
7 | 2102602511115554 |
oct | 224474633051075 |
9 | 40140482157252 |
10 | 10213003121213 |
11 | 3288346011692 |
12 | 118b4220b8225 |
13 | 59110b39cc59 |
14 | 27445214cd9b |
15 | 12a9e4c33d28 |
hex | 949e66c523d |
10213003121213 has 16 divisors (see below), whose sum is σ = 10293825197376. Its totient is φ = 10132521936000.
The previous prime is 10213003121201. The next prime is 10213003121231. The reversal of 10213003121213 is 31212130031201.
It is a happy number.
10213003121213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10213003121213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213003141213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 249790070 + ... + 249830952.
It is an arithmetic number, because the mean of its divisors is an integer number (643364074836).
Almost surely, 210213003121213 is an apocalyptic number.
It is an amenable number.
10213003121213 is a deficient number, since it is larger than the sum of its proper divisors (80822076163).
10213003121213 is a wasteful number, since it uses less digits than its factorization.
10213003121213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45004.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10213003121213 its reverse (31212130031201), we get a palindrome (41425133152414).
The spelling of 10213003121213 in words is "ten trillion, two hundred thirteen billion, three million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •