Base | Representation |
---|---|
bin | 1000101111011010001… |
… | …11111011011100110010 |
3 | 1001201012120210200202000 |
4 | 10113231013323130302 |
5 | 14410034220202010 |
6 | 345545320034430 |
7 | 30461324365416 |
oct | 4275507733462 |
9 | 1051176720660 |
10 | 300331022130 |
11 | 10640803a107 |
12 | 4a258302a16 |
13 | 2242359b9a9 |
14 | 107710acd46 |
15 | 7c2b7997c0 |
hex | 45ed1fb732 |
300331022130 has 32 divisors (see below), whose sum is σ = 800882726400. Its totient is φ = 80088272496.
The previous prime is 300331022111. The next prime is 300331022153. The reversal of 300331022130 is 31220133003.
300331022130 is a `hidden beast` number, since 300 + 3 + 310 + 2 + 21 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 556168290 + ... + 556168829.
It is an arithmetic number, because the mean of its divisors is an integer number (25027585200).
Almost surely, 2300331022130 is an apocalyptic number.
300331022130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
300331022130 is an abundant number, since it is smaller than the sum of its proper divisors (500551704270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300331022130 is a wasteful number, since it uses less digits than its factorization.
300331022130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112337135 (or 1112337129 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 300331022130 its reverse (31220133003), we get a palindrome (331551155133).
The spelling of 300331022130 in words is "three hundred billion, three hundred thirty-one million, twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •