Base | Representation |
---|---|
bin | 11100001000101111… |
… | …000101010000111010 |
3 | 2212222110221122012000 |
4 | 130020233011100322 |
5 | 443333100044010 |
6 | 21513501401430 |
7 | 2116444035411 |
oct | 341057052072 |
9 | 85873848160 |
10 | 30211331130 |
11 | 118a3566262 |
12 | 5a31869276 |
13 | 2b060b8ac6 |
14 | 166853a478 |
15 | bbc4707c0 |
hex | 708bc543a |
30211331130 has 64 divisors (see below), whose sum is σ = 81766039680. Its totient is φ = 7936106112.
The previous prime is 30211331107. The next prime is 30211331153. The reversal of 30211331130 is 3113311203.
It is a happy number.
30211331130 is a `hidden beast` number, since 302 + 1 + 1 + 331 + 1 + 30 = 666.
It is an interprime number because it is at equal distance from previous prime (30211331107) and next prime (30211331153).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 816939 + ... + 853118.
It is an arithmetic number, because the mean of its divisors is an integer number (1277594370).
Almost surely, 230211331130 is an apocalyptic number.
30211331130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30211331130 is an abundant number, since it is smaller than the sum of its proper divisors (51554708550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30211331130 is a wasteful number, since it uses less digits than its factorization.
30211331130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1670140 (or 1670134 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 30211331130 its reverse (3113311203), we get a palindrome (33324642333).
The spelling of 30211331130 in words is "thirty billion, two hundred eleven million, three hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •