Base | Representation |
---|---|
bin | 101111101001101011… |
… | …1001000001000110111 |
3 | 100210010120112000001101 |
4 | 1133103113020020313 |
5 | 3134033024144111 |
6 | 115002045310531 |
7 | 10251561136615 |
oct | 1372327101067 |
9 | 323116460041 |
10 | 102330303031 |
11 | 3a441874280 |
12 | 179ba265447 |
13 | 985a534788 |
14 | 4d4a73a6b5 |
15 | 29ddae4bc1 |
hex | 17d35c8237 |
102330303031 has 8 divisors (see below), whose sum is σ = 115482474000. Its totient is φ = 89819701440.
The previous prime is 102330302951. The next prime is 102330303041. The reversal of 102330303031 is 130303033201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102330303031 - 29 = 102330302519 is a prime.
It is a super-2 number, since 2×1023303030312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102330303041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 160392006 + ... + 160392643.
It is an arithmetic number, because the mean of its divisors is an integer number (14435309250).
Almost surely, 2102330303031 is an apocalyptic number.
102330303031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102330303031 is a deficient number, since it is larger than the sum of its proper divisors (13152170969).
102330303031 is a wasteful number, since it uses less digits than its factorization.
102330303031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320784689.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 102330303031 its reverse (130303033201), we get a palindrome (232633336232).
The spelling of 102330303031 in words is "one hundred two billion, three hundred thirty million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •