Base | Representation |
---|---|
bin | 10010110100001100… |
… | …010101000110010101 |
3 | 1221010222111202012011 |
4 | 102310030111012111 |
5 | 312333432001323 |
6 | 13140420224221 |
7 | 1313435445154 |
oct | 226414250625 |
9 | 57128452164 |
10 | 20203000213 |
11 | 86280810a0 |
12 | 3ab9b3b071 |
13 | 1b9c7726c6 |
14 | d9924959b |
15 | 7d39b920d |
hex | 4b4315195 |
20203000213 has 8 divisors (see below), whose sum is σ = 22050396576. Its totient is φ = 18357397200.
The previous prime is 20203000211. The next prime is 20203000273. The reversal of 20203000213 is 31200030202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20203000213 - 21 = 20203000211 is a prime.
It is a super-2 number, since 2×202030002132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20203000193 and 20203000202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20203000211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 424723 + ... + 469888.
It is an arithmetic number, because the mean of its divisors is an integer number (2756299572).
Almost surely, 220203000213 is an apocalyptic number.
It is an amenable number.
20203000213 is a deficient number, since it is larger than the sum of its proper divisors (1847396363).
20203000213 is a wasteful number, since it uses less digits than its factorization.
20203000213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896675.
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 20203000213 its reverse (31200030202), we get a palindrome (51403030415).
The spelling of 20203000213 in words is "twenty billion, two hundred three million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •