Base | Representation |
---|---|
bin | 1000101110110110100… |
… | …11010101001010001010 |
3 | 1001200102202011212110220 |
4 | 10113123103111022022 |
5 | 14403431144134010 |
6 | 345455515250510 |
7 | 30451034046402 |
oct | 4273323251212 |
9 | 1050382155426 |
10 | 300032021130 |
11 | 106274288246 |
12 | 4a194149a36 |
13 | 223a666081a |
14 | 107434b9802 |
15 | 7c103d6970 |
hex | 45db4d528a |
300032021130 has 32 divisors (see below), whose sum is σ = 721146849984. Its totient is φ = 79889650176.
The previous prime is 300032021119. The next prime is 300032021141. The reversal of 300032021130 is 31120230003.
It is an interprime number because it is at equal distance from previous prime (300032021119) and next prime (300032021141).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7410024 + ... + 7450403.
It is an arithmetic number, because the mean of its divisors is an integer number (22535839062).
Almost surely, 2300032021130 is an apocalyptic number.
300032021130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
300032021130 is an abundant number, since it is smaller than the sum of its proper divisors (421114828854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300032021130 is a wasteful number, since it uses less digits than its factorization.
300032021130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14861110.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 300032021130 its reverse (31120230003), we get a palindrome (331152251133).
The spelling of 300032021130 in words is "three hundred billion, thirty-two million, twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •