Base | Representation |
---|---|
bin | 1011110101010110111… |
… | …1111101110000110101 |
3 | 201102202110202202011012 |
4 | 2331111233331300311 |
5 | 11312330314200041 |
6 | 233221245322005 |
7 | 20455005223526 |
oct | 2752557756065 |
9 | 642673682135 |
10 | 203302100021 |
11 | 7924680a889 |
12 | 33499566305 |
13 | 1622c488307 |
14 | 9ba888684d |
15 | 544d2de3eb |
hex | 2f55bfdc35 |
203302100021 has 4 divisors (see below), whose sum is σ = 204052292544. Its totient is φ = 202551907500.
The previous prime is 203302100011. The next prime is 203302100033. The reversal of 203302100021 is 120001203302.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 203302100021 - 210 = 203302098997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203302099969 and 203302100005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203302100011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 375095855 + ... + 375096396.
It is an arithmetic number, because the mean of its divisors is an integer number (51013073136).
Almost surely, 2203302100021 is an apocalyptic number.
It is an amenable number.
203302100021 is a deficient number, since it is larger than the sum of its proper divisors (750192523).
203302100021 is an equidigital number, since it uses as much as digits as its factorization.
203302100021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750192522.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 203302100021 its reverse (120001203302), we get a palindrome (323303303323).
The spelling of 203302100021 in words is "two hundred three billion, three hundred two million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •