Base | Representation |
---|---|
bin | 110000000100000001… |
… | …0101100111001100110 |
3 | 100212102011121121212002 |
4 | 1200020002230321212 |
5 | 3142340310003110 |
6 | 115225501125302 |
7 | 10312512503030 |
oct | 1401002547146 |
9 | 325364547762 |
10 | 103214141030 |
11 | 3a855767900 |
12 | 18006259832 |
13 | 996b68c940 |
14 | 4dd1c8ac50 |
15 | 2a414ccaa5 |
hex | 18080ace66 |
103214141030 has 96 divisors (see below), whose sum is σ = 251336215872. Its totient is φ = 29695944960.
The previous prime is 103214141011. The next prime is 103214141033. The reversal of 103214141030 is 30141412301.
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 103214140993 and 103214141011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103214141033) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 358577 + ... + 578796.
It is an arithmetic number, because the mean of its divisors is an integer number (2618085582).
Almost surely, 2103214141030 is an apocalyptic number.
103214141030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103214141030 is an abundant number, since it is smaller than the sum of its proper divisors (148122074842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103214141030 is a wasteful number, since it uses less digits than its factorization.
103214141030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 937422 (or 937411 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 103214141030 its reverse (30141412301), we get a palindrome (133355553331).
The spelling of 103214141030 in words is "one hundred three billion, two hundred fourteen million, one hundred forty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •