Base | Representation |
---|---|
bin | 1101101001000111010110… |
… | …10101111110000001100111 |
3 | 10221012222020120200202121221 |
4 | 12310203223111332001213 |
5 | 12413010000000000403 |
6 | 143445450523121211 |
7 | 6214266652366420 |
oct | 664435325760147 |
9 | 127188216622557 |
10 | 30000000000103 |
11 | 9616a239a1141 |
12 | 344624b373207 |
13 | 1397cac43c303 |
14 | 75a01738a647 |
15 | 37057ecc8dbd |
hex | 1b48eb57e067 |
30000000000103 has 32 divisors (see below), whose sum is σ = 37494152539776. Its totient is φ = 23419770236928.
The previous prime is 30000000000079. The next prime is 30000000000109. The reversal of 30000000000103 is 30100000000003.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 30000000000103 - 217 = 29999999869031 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 29999999999987 and 30000000000086.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30000000000109) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32119176 + ... + 33039997.
It is an arithmetic number, because the mean of its divisors is an integer number (1171692266868).
Almost surely, 230000000000103 is an apocalyptic number.
30000000000103 is a deficient number, since it is larger than the sum of its proper divisors (7494152539673).
30000000000103 is a wasteful number, since it uses less digits than its factorization.
30000000000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65159323.
The product of its (nonzero) digits is 9, while the sum is 7.
Adding to 30000000000103 its reverse (30100000000003), we get a palindrome (60100000000106).
The spelling of 30000000000103 in words is "thirty trillion, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •