Base | Representation |
---|---|
bin | 101111110100011010011100… |
… | …111110110010011110110011 |
3 | 1000120122102212122220220112111 |
4 | 233310122130332302132303 |
5 | 210031204341043240311 |
6 | 2023143025320110151 |
7 | 62204252625145243 |
oct | 5764323476623663 |
9 | 1016572778826474 |
10 | 210310002321331 |
11 | 61013a755a3730 |
12 | 1b7075a2305357 |
13 | 90471c0566c23 |
14 | 39d10b645db23 |
15 | 194a9a485bd21 |
hex | bf469cfb27b3 |
210310002321331 has 8 divisors (see below), whose sum is σ = 229879838228400. Its totient is φ = 190815290545440.
The previous prime is 210310002321319. The next prime is 210310002321337. The reversal of 210310002321331 is 133123200013012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210310002321331 - 219 = 210310001797043 is a prime.
It is a super-2 number, since 2×2103100023213312 (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 (210310002321337) 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, 18781026936 + ... + 18781038133.
It is an arithmetic number, because the mean of its divisors is an integer number (28734979778550).
Almost surely, 2210310002321331 is an apocalyptic number.
210310002321331 is a deficient number, since it is larger than the sum of its proper divisors (19569835907069).
210310002321331 is a wasteful number, since it uses less digits than its factorization.
210310002321331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37562065589.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 210310002321331 its reverse (133123200013012), we get a palindrome (343433202334343).
The spelling of 210310002321331 in words is "two hundred ten trillion, three hundred ten billion, two million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •