Base | Representation |
---|---|
bin | 11100000010001011… |
… | …000000111111001010 |
3 | 2212200210202001200120 |
4 | 130002023000333022 |
5 | 443121402310010 |
6 | 21454525244110 |
7 | 2113636042602 |
oct | 340213007712 |
9 | 85623661616 |
10 | 30101213130 |
11 | 11847393a4a |
12 | 5a00a03636 |
13 | 2ab9341b21 |
14 | 1657a73c02 |
15 | bb296ce70 |
hex | 7022c0fca |
30101213130 has 96 divisors (see below), whose sum is σ = 74323438272. Its totient is φ = 7802096640.
The previous prime is 30101213083. The next prime is 30101213141. The reversal of 30101213130 is 3131210103.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15783637 + ... + 15785543.
It is an arithmetic number, because the mean of its divisors is an integer number (774202482).
Almost surely, 230101213130 is an apocalyptic number.
30101213130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 30101213130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37161719136).
30101213130 is an abundant number, since it is smaller than the sum of its proper divisors (44222225142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30101213130 is a wasteful number, since it uses less digits than its factorization.
30101213130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2312 (or 2271 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 30101213130 its reverse (3131210103), we get a palindrome (33232423233).
The spelling of 30101213130 in words is "thirty billion, one hundred one million, two hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •