Base | Representation |
---|---|
bin | 110000000001001111… |
… | …1110010100101101010 |
3 | 100212011200112210221220 |
4 | 1200002133302211222 |
5 | 3142143000300320 |
6 | 115212335042510 |
7 | 10310302625526 |
oct | 1400237624552 |
9 | 325150483856 |
10 | 103121103210 |
11 | 3a8081a1144 |
12 | 17b9b070436 |
13 | 9955316088 |
14 | 4dc378cd86 |
15 | 2a38250e40 |
hex | 18027f296a |
103121103210 has 32 divisors (see below), whose sum is σ = 248286460032. Its totient is φ = 27410537280.
The previous prime is 103121103179. The next prime is 103121103223. The reversal of 103121103210 is 12301121301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 103121103210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5516989 + ... + 5535648.
It is an arithmetic number, because the mean of its divisors is an integer number (7758951876).
Almost surely, 2103121103210 is an apocalyptic number.
103121103210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103121103210 is an abundant number, since it is smaller than the sum of its proper divisors (145165356822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103121103210 is a wasteful number, since it uses less digits than its factorization.
103121103210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11052958.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103121103210 its reverse (12301121301), we get a palindrome (115422224511).
The spelling of 103121103210 in words is "one hundred three billion, one hundred twenty-one million, one hundred three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •