Base | Representation |
---|---|
bin | 110000000100001110… |
… | …0111000011101001110 |
3 | 100212102122112022020020 |
4 | 1200020130320131032 |
5 | 3142344034112420 |
6 | 115230304203010 |
7 | 10312625026020 |
oct | 1401034703516 |
9 | 325378468206 |
10 | 103221004110 |
11 | 3a859625174 |
12 | 18008609466 |
13 | 996cc23733 |
14 | 4dd2b56010 |
15 | 2a41dd6340 |
hex | 180873874e |
103221004110 has 64 divisors (see below), whose sum is σ = 292253405184. Its totient is φ = 22832294400.
The previous prime is 103221004099. The next prime is 103221004121. The reversal of 103221004110 is 11400122301.
It is an interprime number because it is at equal distance from previous prime (103221004099) and next prime (103221004121).
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 103221004110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7921371 + ... + 7934390.
It is an arithmetic number, because the mean of its divisors is an integer number (4566459456).
Almost surely, 2103221004110 is an apocalyptic number.
103221004110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103221004110 is an abundant number, since it is smaller than the sum of its proper divisors (189032401074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103221004110 is a wasteful number, since it uses less digits than its factorization.
103221004110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15855809.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 103221004110 its reverse (11400122301), we get a palindrome (114621126411).
The spelling of 103221004110 in words is "one hundred three billion, two hundred twenty-one million, four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •