Base | Representation |
---|---|
bin | 101110001110100110000000… |
… | …010101111011100001001101 |
3 | 222122212112102221111011002022 |
4 | 232032212000111323201031 |
5 | 203122040031122420323 |
6 | 2000224413444335525 |
7 | 60552611112603200 |
oct | 5616460025734115 |
9 | 878775387434068 |
10 | 203313020123213 |
11 | 59866627555630 |
12 | 1a9775130a45a5 |
13 | 895a4492168b0 |
14 | 382c58cd45937 |
15 | 187898906b4c8 |
hex | b8e98057b84d |
203313020123213 has 48 divisors (see below), whose sum is σ = 277978254878016. Its totient is φ = 146173926044160.
The previous prime is 203313020123209. The next prime is 203313020123261. The reversal of 203313020123213 is 312321020313302.
It is not a de Polignac number, because 203313020123213 - 22 = 203313020123209 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203313020123203) 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 47 ways as a sum of consecutive naturals, for example, 9248645 + ... + 22184757.
It is an arithmetic number, because the mean of its divisors is an integer number (5791213643292).
Almost surely, 2203313020123213 is an apocalyptic number.
It is an amenable number.
203313020123213 is a deficient number, since it is larger than the sum of its proper divisors (74665234754803).
203313020123213 is a wasteful number, since it uses less digits than its factorization.
203313020123213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12938394 (or 12938387 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 203313020123213 its reverse (312321020313302), we get a palindrome (515634040436515).
The spelling of 203313020123213 in words is "two hundred three trillion, three hundred thirteen billion, twenty million, one hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •