Base | Representation |
---|---|
bin | 10111001100011100011011… |
… | …100010001111111000110111 |
3 | 111101012002020100002220021021 |
4 | 113030130123202033320313 |
5 | 101332313422413210403 |
6 | 1000542504112402011 |
7 | 30325665413041615 |
oct | 2714343342177067 |
9 | 441162210086237 |
10 | 102010230210103 |
11 | 2a55a328609256 |
12 | b536323846307 |
13 | 44bc6a5c9b577 |
14 | 1b2947022c6b5 |
15 | bbd7c09808bd |
hex | 5cc71b88fe37 |
102010230210103 has 4 divisors (see below), whose sum is σ = 102029746234120. Its totient is φ = 101990714186088.
The previous prime is 102010230210073. The next prime is 102010230210149. The reversal of 102010230210103 is 301012032010201.
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 102010230210103 - 225 = 102010196655671 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 (102010230310103) 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, 9758004168 + ... + 9758014621.
It is an arithmetic number, because the mean of its divisors is an integer number (25507436558530).
Almost surely, 2102010230210103 is an apocalyptic number.
102010230210103 is a deficient number, since it is larger than the sum of its proper divisors (19516024017).
102010230210103 is an equidigital number, since it uses as much as digits as its factorization.
102010230210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19516024016.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102010230210103 its reverse (301012032010201), we get a palindrome (403022262220304).
The spelling of 102010230210103 in words is "one hundred two trillion, ten billion, two hundred thirty million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •