Base | Representation |
---|---|
bin | 110000011001010111… |
… | …0011110111000100110 |
3 | 100221021002010021211001 |
4 | 1200302232132320212 |
5 | 3200322121323110 |
6 | 115424522103514 |
7 | 10336326433321 |
oct | 1406256367046 |
9 | 327232107731 |
10 | 103930261030 |
11 | 40092a17412 |
12 | 1818604ab9a |
13 | 9a53b5439b |
14 | 505d01d7b8 |
15 | 2a842d663a |
hex | 1832b9ee26 |
103930261030 has 32 divisors (see below), whose sum is σ = 189194404896. Its totient is φ = 41101876224.
The previous prime is 103930261007. The next prime is 103930261033. The reversal of 103930261030 is 30162039301.
It is a self number, because there is not a number n which added to its sum of digits gives 103930261030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103930261033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 913357 + ... + 1020823.
It is an arithmetic number, because the mean of its divisors is an integer number (5912325153).
Almost surely, 2103930261030 is an apocalyptic number.
103930261030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103930261030 is a deficient number, since it is larger than the sum of its proper divisors (85264143866).
103930261030 is a wasteful number, since it uses less digits than its factorization.
103930261030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108568.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 103930261030 in words is "one hundred three billion, nine hundred thirty million, two hundred sixty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •