Base | Representation |
---|---|
bin | 110000000011111001… |
… | …1010011010110100110 |
3 | 100212101220000112101222 |
4 | 1200013303103112212 |
5 | 3142333241313410 |
6 | 115225234420342 |
7 | 10312433260652 |
oct | 1400763232646 |
9 | 325356015358 |
10 | 103210104230 |
11 | 3a85345aa02 |
12 | 18004a316b2 |
13 | 996a8a83bc |
14 | 4dd1519a62 |
15 | 2a40e81955 |
hex | 1807cd35a6 |
103210104230 has 8 divisors (see below), whose sum is σ = 185778187632. Its totient is φ = 41284041688.
The previous prime is 103210104229. The next prime is 103210104233. The reversal of 103210104230 is 32401012301.
103210104230 is digitally balanced in base 3, 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 junction number, because it is equal to n+sod(n) for n = 103210104199 and 103210104208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103210104233) 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, 5160505202 + ... + 5160505221.
It is an arithmetic number, because the mean of its divisors is an integer number (23222273454).
Almost surely, 2103210104230 is an apocalyptic number.
103210104230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103210104230 is a deficient number, since it is larger than the sum of its proper divisors (82568083402).
103210104230 is a wasteful number, since it uses less digits than its factorization.
103210104230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10321010430.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 103210104230 its reverse (32401012301), we get a palindrome (135611116531).
The spelling of 103210104230 in words is "one hundred three billion, two hundred ten million, one hundred four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •