Base | Representation |
---|---|
bin | 10111011100010011011000… |
… | …101010111100111001100010 |
3 | 111112001021012100212221221222 |
4 | 113130103120222330321202 |
5 | 102003142330202030310 |
6 | 1003135255554415042 |
7 | 30500505600256100 |
oct | 2734233052747142 |
9 | 445037170787858 |
10 | 103100030111330 |
11 | 2a93a52820504a |
12 | b691587591482 |
13 | 456b3a2799125 |
14 | 1b660d4b66c70 |
15 | bdbd05bea055 |
hex | 5dc4d8abce62 |
103100030111330 has 24 divisors (see below), whose sum is σ = 215878838560668. Its totient is φ = 35348581752288.
The previous prime is 103100030111303. The next prime is 103100030111347. The reversal of 103100030111330 is 33111030001301.
It can be written as a sum of positive squares in 2 ways, for example, as 101797142554849 + 1302887556481 = 10089457^2 + 1141441^2 .
It is a junction number, because it is equal to n+sod(n) for n = 103100030111299 and 103100030111308.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 105204111869 + ... + 105204112848.
Almost surely, 2103100030111330 is an apocalyptic number.
103100030111330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103100030111330 is an abundant number, since it is smaller than the sum of its proper divisors (112778808449338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103100030111330 is a wasteful number, since it uses less digits than its factorization.
103100030111330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210408224738 (or 210408224731 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 103100030111330 its reverse (33111030001301), we get a palindrome (136211060112631).
The spelling of 103100030111330 in words is "one hundred three trillion, one hundred billion, thirty million, one hundred eleven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •