Base | Representation |
---|---|
bin | 110000000110111100… |
… | …1001001111111001110 |
3 | 100212200000022201102200 |
4 | 1200031321021333032 |
5 | 3143040422131110 |
6 | 115243325102330 |
7 | 10315114035510 |
oct | 1401571117716 |
9 | 325600281380 |
10 | 103312302030 |
11 | 3a8a61126a3 |
12 | 180330b79a6 |
13 | 9985b0b382 |
14 | 5000d1dbb0 |
15 | 2a49e1c6c0 |
hex | 180de49fce |
103312302030 has 48 divisors (see below), whose sum is σ = 306985127904. Its totient is φ = 23614240320.
The previous prime is 103312301999. The next prime is 103312302113. The reversal of 103312302030 is 30203213301.
103312302030 is a `hidden beast` number, since 1 + 0 + 331 + 2 + 302 + 0 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 103312301994 and 103312302012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81993261 + ... + 81994520.
It is an arithmetic number, because the mean of its divisors is an integer number (6395523498).
Almost surely, 2103312302030 is an apocalyptic number.
103312302030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103312302030 is an abundant number, since it is smaller than the sum of its proper divisors (203672825874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103312302030 is a wasteful number, since it uses less digits than its factorization.
103312302030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163987801 (or 163987798 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 103312302030 its reverse (30203213301), we get a palindrome (133515515331).
The spelling of 103312302030 in words is "one hundred three billion, three hundred twelve million, three hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •