Base | Representation |
---|---|
bin | 101111110010110111000101… |
… | …000010100111011111000111 |
3 | 1000120021020110102010002220002 |
4 | 233302313011002213133013 |
5 | 210022432324324343421 |
6 | 2023022021340031515 |
7 | 62163454510303145 |
oct | 5762670502473707 |
9 | 1016236412102802 |
10 | 210203300231111 |
11 | 60a8279aa9aaa0 |
12 | 1b6aa983b3259b |
13 | 903a117399b35 |
14 | 39c9c73270595 |
15 | 1947d0c052b0b |
hex | bf2dc50a77c7 |
210203300231111 has 8 divisors (see below), whose sum is σ = 229349576018064. Its totient is φ = 191063171920320.
The previous prime is 210203300231087. The next prime is 210203300231123. The reversal of 210203300231111 is 111132003302012.
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 a de Polignac number, because none of the positive numbers 2k-210203300231111 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 (210203300231161) 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, 1536797540 + ... + 1536934313.
It is an arithmetic number, because the mean of its divisors is an integer number (28668697002258).
Almost surely, 2210203300231111 is an apocalyptic number.
210203300231111 is a deficient number, since it is larger than the sum of its proper divisors (19146275786953).
210203300231111 is a wasteful number, since it uses less digits than its factorization.
210203300231111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3073738081.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 210203300231111 its reverse (111132003302012), we get a palindrome (321335303533123).
The spelling of 210203300231111 in words is "two hundred ten trillion, two hundred three billion, three hundred million, two hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •