Base | Representation |
---|---|
bin | 110000000111100000… |
… | …1101000101011100001 |
3 | 100212201100002000122110 |
4 | 1200033001220223201 |
5 | 3143110303131423 |
6 | 115245244225533 |
7 | 10315434401364 |
oct | 1401701505341 |
9 | 325640060573 |
10 | 103331302113 |
11 | 3a90590a746 |
12 | 1803953b2a9 |
13 | 9989a31620 |
14 | 50036680db |
15 | 2a4b922193 |
hex | 180f068ae1 |
103331302113 has 16 divisors (see below), whose sum is σ = 157100985216. Its totient is φ = 59847993600.
The previous prime is 103331302093. The next prime is 103331302171. The reversal of 103331302113 is 311203133301.
It is not a de Polignac number, because 103331302113 - 225 = 103297747681 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103331302113.
It is not an unprimeable number, because it can be changed into a prime (103331307113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77926413 + ... + 77927738.
It is an arithmetic number, because the mean of its divisors is an integer number (9818811576).
Almost surely, 2103331302113 is an apocalyptic number.
103331302113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
103331302113 is a deficient number, since it is larger than the sum of its proper divisors (53769683103).
103331302113 is a wasteful number, since it uses less digits than its factorization.
103331302113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155854184.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103331302113 its reverse (311203133301), we get a palindrome (414534435414).
The spelling of 103331302113 in words is "one hundred three billion, three hundred thirty-one million, three hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •