Base | Representation |
---|---|
bin | 101111101111111011100110… |
… | …100111111100101001011011 |
3 | 1000112112222212110121010011121 |
4 | 233233323212213330221123 |
5 | 210011133044022433311 |
6 | 2022345330445510111 |
7 | 62143100222265601 |
oct | 5757734647745133 |
9 | 1015488773533147 |
10 | 210002000202331 |
11 | 60a05391411a47 |
12 | 1b677964b72337 |
13 | 902414693287c |
14 | 39c0218661871 |
15 | 19429798d4b71 |
hex | befee69fca5b |
210002000202331 has 4 divisors (see below), whose sum is σ = 217243448485200. Its totient is φ = 202760551919464.
The previous prime is 210002000202301. The next prime is 210002000202343. The reversal of 210002000202331 is 133202000200012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 210002000202331 - 25 = 210002000202299 is a prime.
It is a super-2 number, since 2×2100020002023312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210002000202301) 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, 3620724141391 + ... + 3620724141448.
It is an arithmetic number, because the mean of its divisors is an integer number (54310862121300).
Almost surely, 2210002000202331 is an apocalyptic number.
210002000202331 is a deficient number, since it is larger than the sum of its proper divisors (7241448282869).
210002000202331 is an equidigital number, since it uses as much as digits as its factorization.
210002000202331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7241448282868.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 210002000202331 its reverse (133202000200012), we get a palindrome (343204000402343).
The spelling of 210002000202331 in words is "two hundred ten trillion, two billion, two hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •