Base | Representation |
---|---|
bin | 1000110011000100111… |
… | …11010111110111110010 |
3 | 1001220021210222022200220 |
4 | 10121202133113313302 |
5 | 14423102311232010 |
6 | 350512540153510 |
7 | 30561164320425 |
oct | 4314237276762 |
9 | 1056253868626 |
10 | 302300102130 |
11 | 107228588054 |
12 | 4a707838896 |
13 | 2267850b3a0 |
14 | 108ba7d99bc |
15 | 7ce45a0970 |
hex | 46627d7df2 |
302300102130 has 32 divisors (see below), whose sum is σ = 781329495744. Its totient is φ = 74412332736.
The previous prime is 302300102113. The next prime is 302300102161. The reversal of 302300102130 is 31201003203.
302300102130 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
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 (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 387563844 + ... + 387564623.
It is an arithmetic number, because the mean of its divisors is an integer number (24416546742).
Almost surely, 2302300102130 is an apocalyptic number.
302300102130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
302300102130 is an abundant number, since it is smaller than the sum of its proper divisors (479029393614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302300102130 is a wasteful number, since it uses less digits than its factorization.
302300102130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775128490.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 302300102130 its reverse (31201003203), we get a palindrome (333501105333).
The spelling of 302300102130 in words is "three hundred two billion, three hundred million, one hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •