Base | Representation |
---|---|
bin | 1100001111100101101… |
… | …1010000011001000111 |
3 | 202002221011122201010010 |
4 | 3003321123100121013 |
5 | 11421240313231043 |
6 | 240344050401303 |
7 | 21124332603255 |
oct | 3037133203107 |
9 | 662834581103 |
10 | 210343102023 |
11 | 8122a2198aa |
12 | 34923590233 |
13 | 16ab2118ba2 |
14 | a275a375d5 |
15 | 5711507133 |
hex | 30f96d0647 |
210343102023 has 8 divisors (see below), whose sum is σ = 280619309808. Its totient is φ = 140147814464.
The previous prime is 210343102019. The next prime is 210343102037. The reversal of 210343102023 is 320201343012.
210343102023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 210343102023 - 22 = 210343102019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210343102063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20223990 + ... + 20234387.
It is an arithmetic number, because the mean of its divisors is an integer number (35077413726).
Almost surely, 2210343102023 is an apocalyptic number.
210343102023 is a deficient number, since it is larger than the sum of its proper divisors (70276207785).
210343102023 is a wasteful number, since it uses less digits than its factorization.
210343102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40460113.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 210343102023 its reverse (320201343012), we get a palindrome (530544445035).
The spelling of 210343102023 in words is "two hundred ten billion, three hundred forty-three million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •